<｜begin▁of▁sentence｜>### Instruction:
Given a directed acyclic graph (DAG) with the edge list [(0, 1), (1, 2), (2, 3), (1, 3), (0, 4)], use the topological_sorting function from igraph library to find a valid topological order for the vertices.
### Response:
from igraph import Graph

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

# Create the graph with the defined edges
graph = Graph(edges=edges, directed=True)

# Get the topological sorting of the graph nodes
sort_order = graph.topological_sorting()
print('Topological sorting:', sort_order)
<|EOT|>
