<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edge set [(0, 1), (1, 2), (2, 3), (0, 3), (2, 4), (4, 5), (5, 3)] and edges capacities [10, 10, 10, 1, 10, 10, 1], can you use the all_st_mincuts function in igraph to find and print all minimum edge-cuts along with their capacities between source node 0 and target node 3?
### Response:
import igraph as ig

# Create a directed graph with nine nodes and weighted edges
g = ig.Graph(edges=[(0, 1), (1, 2), (2, 3), (0, 3), (2, 4), (4, 5), (5, 3)], directed=True)

g.es['capacity'] = [10, 10, 10, 1, 10, 10, 1]  # Assigning capacities to edges

# Find all minimum cuts between source node 0 and target node 3
cuts = g.all_st_mincuts(source=0, target=3, capacity='capacity')

# Print all mincuts
cut_list = [cut.value for cut in cuts]
print('All minimum cuts between node 0 and node 3:', cut_list)
<|EOT|>
