<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph which can be created with the provided edges list, can you use the all_st_mincuts function to find and display all minimum cuts between source and target vertices?
### Response:
from igraph import Graph

# Create an example directed graph
edges = [(0, 1), (1, 2), (2, 3), (3, 4), (4, 0), (1, 3)]
g = Graph(edges=edges, directed=True)

# Use the all_st_mincuts function to find all minimum cuts between source and target
source_vertex = 0
target_vertex = 4
min_cuts = g.all_st_mincuts(source_vertex, target_vertex)

# Print all minimum cuts
for min_cut in min_cuts:
    print(min_cut)
<|EOT|>
