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

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

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

# Print out all the shortest paths
for path in paths:
    print('->'.join(map(str, path)))
<|EOT|>
