<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edge set `[(0, 1), (1, 2), (2, 0), (1, 3), (3, 4), (4, 2)]`, can you use the `all_st_mincuts` function in igraph to find and print all minimum cuts between vertex 1 and vertex 4? The cuts should include the partition and the value of each cut.
### Response:
from igraph import Graph

# Define edges for the graph
g = Graph(edges=[(0, 1), (1, 2), (2, 0), (1, 3), (3, 4), (4, 2)])

# Find all the mincuts between vertex 1 and vertex 4
all_cuts = g.all_st_mincuts(1, 4)

# Print the cuts
for cut in all_cuts:
    print(cut.partition, cut.value)
<|EOT|>
