<｜begin▁of▁sentence｜>### Instruction:
As a Teacher Assistant, imagine you are helping a group of students analyze a transportation network for a city. The network is represented as a directed graph with the following routes: from 0 to 1, from 0 to 2, from 1 to 3, and from 2 to 3. Now, the students need to find all possible ways to divide the network into parts, or "cuts," to identify the different paths from the starting point at vertex 0 to the destination at vertex 3. What would be the steps to accomplish this using the all_st_cuts function in the Python igraph library?
### Response:
import igraph as ig

# Create a directed graph with edge capacities
edges = [(0, 1), (0, 2), (1, 3), (2, 3)]
g = ig.Graph(edges, directed=True)

# Call all_st_cuts to get all cuts between vertex 0 and vertex 3
all_cuts = g.all_st_cuts(source=0, target=3)

# Extract edges involved in all cuts
edge_cuts = all_cuts[0]

# Print all cut edges
for cut_edges in edge_cuts:
    print([g.es[edge_id].tuple for edge_id in cut_edges])
<|EOT|>
