<｜begin▁of▁sentence｜>### Instruction:
Given a directed acyclic graph with edges (0, 1), (0, 2), (1, 3), (2, 3), (3, 4), can you use the `topological_sorting` function in igraph to calculate a possible topological sorting of the graph?
### Response:
import igraph as ig

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

# Get a possible topological sorting
sorting = g.topological_sorting(mode='out')

# Print the topological sorting
print('Topological sorting:', sorting)
<|EOT|>
