<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edge set (0, 1), (1, 2), (2, 3), (3, 4), can you use the get_shortest_paths function in igraph to find the shortest path from vertex 0 to vertex 4?
### Response:
from igraph import Graph

g = Graph(edges=[(0, 1), (1, 2), (2, 3), (3, 4)])
source_vertex = 0
target_vertex = 4

# Calculate the shortest path from source_vertex to target_vertex
shortest_path = g.get_shortest_paths(v=source_vertex, to=target_vertex)

# Print the shortest path
print(shortest_path)
<|EOT|>
