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

# Define the edges for the directed acyclic graph (DAG)
edges = [(0, 1), (1, 2), (2, 3), (3, 4)]

# Create the graph with the defined directed edges
# Note: Directed graphs need a 'directed=True' parameter
graph = Graph(edges=edges, directed=True)

# Calculate a topological sorting order
sorting_order = graph.topological_sorting(mode='out')
print(sorting_order)
<|EOT|>
