<｜begin▁of▁sentence｜>### Instruction:
Given a graph which you can read from graph.gml, can you calculate the 3 shortest paths from vertex with ID 1 to vertex with ID 5 in the graph using igraph's get_k_shortest_paths function?
### Response:
from igraph import Graph

g = Graph.Read_GML('graph.gml')

# Calculate the 3 shortest paths from vertex 1 to vertex 5
k_shortest_paths = g.get_k_shortest_paths(1, to=5, k=3, weights=None, mode='ALL', output='vpath')

# Print the k shortest paths
for i, path in enumerate(k_shortest_paths):
    print(f'Path {i+1}: {path}')
<|EOT|>
