<｜begin▁of▁sentence｜>### Instruction:
As a hydrologist, you have been tasked with analyzing the flow of water in a network of rivers and streams. You have gathered data representing the connections between different water sources and need to determine a possible sequence in which the water would flow through these sources. Could you use the topological_sorting function in igraph to calculate a potential order of water flow through the network?
### Response:
import igraph as ig

# Define a directed acyclic graph (DAG)
edges = [(0, 1), (0, 2), (1, 3), (2, 3)]
g = ig.Graph(edges, directed=True)

# Calculate a possible topological sorting of the graph
topological_order = g.topological_sorting()

# Print the topological order
print(topological_order)
<|EOT|>
