<｜begin▁of▁sentence｜>### Instruction:
As a Digital Marketing Manager trying to optimize the reach of an online campaign, imagine you want to analyze the most efficient path for potential customers to navigate through your website. You have a network graph representing the different pages on your website connected by links, and you're interested in finding the shortest path from the homepage (vertex 0) to the checkout page (vertex 4). Utilizing the networkx library in Python, you can use the get_shortest_paths function to calculate the optimal path and further enhance user navigation on your website.
### Response:
from igraph import Graph

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

# Get the shortest path from vertex 0 to vertex 4
shortest_path = g.get_shortest_paths(0, to=4, output='vpath')

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