<｜begin▁of▁sentence｜>### Instruction:
Given a directed acyclic graph (DAG) with edge set [(0, 1), (0, 2), (1, 3), (2, 3)], can you use the topological_sorting function in igraph to calculate a possible topological sorting of the graph?
### 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|>
