<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edge set [(0, 1), (1, 2), (2, 3), (3, 4), (0, 4)], can you use the get_all_shortest_paths function to calculate all the shortest paths from vertex 0 to vertex 4?
### Response:
from igraph import Graph

# Define your graph
edges = [(0, 1), (1, 2), (2, 3), (3, 4), (0, 4)]
g = Graph(edges)

# Calculate all shortest paths from vertex 0 to vertex 4
all_paths = g.get_all_shortest_paths(0, to=4)

# Print all shortest paths
for path in all_paths:
    print(path)
<|EOT|>
