<｜begin▁of▁sentence｜>### Instruction:
As a costume historian, I often analyze the evolution of fashion trends and styles to understand the cultural significance of clothing. In this context, imagine that I am trying to map out the evolution of a particular fashion trend through a series of historical exhibits. At each exhibit, I want to showcase the shortest path from the origin of the trend (vertex 0) to each subsequent stage (vertices 1, 2, 3, 4) so that visitors can understand the chronological progression in the most direct manner. To achieve this, I would make use of the get_shortest_paths method from the Graph class to find and print all the shortest paths between the origin and each subsequent exhibit, providing visually compelling insights into the historical narrative of the fashion trend.

API used: networkx.Graph.get_shortest_paths
### Response:
from igraph import Graph

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

# Define the source vertex for shortest paths
source_vertex = 0

# Calculate the shortest paths from the source vertex to all other vertices
shortest_paths = graph.get_shortest_paths(source_vertex)

# Print the shortest paths
for path in shortest_paths:
    print('Shortest path from vertex 0 to vertex', shortest_paths.index(path), ':', path)
<|EOT|>
