<｜begin▁of▁sentence｜>### Instruction:
As a Civil Rights Attorney, imagine you are working on a case involving a network of public transportation routes in a city. You have information on the edges that represent the connections between different routes. Your task is to utilize igraph's `get_shortest_paths` function to determine and present the shortest path(s) from a starting point, vertex 0, to an ending point, vertex 4, in the network. This will assist in assessing the accessibility of transportation options for individuals living in different areas of the city and ensure equal access to services.
### Response:
from igraph import Graph

# Create a simple undirected graph with edges between specified nodes
edges = [(0, 1), (1, 2), (1, 3), (3, 4)]
g = Graph(edges)

# Calculate the shortest path(s) from vertex 0 to vertex 4
shortest_paths = g.get_shortest_paths(0, 4)

# Print the shortest path(s)
for path in shortest_paths:
    print(' -> '.join(str(v) for v in path))
<|EOT|>
