<｜begin▁of▁sentence｜>### Instruction:
Given a graph which you can read from 'network.gml', can you compute and display all of the shortest paths originating from a specified source vertex in the graph?
### Response:
import igraph as ig

# Load the graph from a file
g = ig.read('network.gml')

# Define source and target vertices
source_vertex = 0

# Compute all shortest paths from source
all_shortest_paths = g.get_all_shortest_paths(source_vertex)

# Print the paths
for path in all_shortest_paths:
    print('Path:', path)
<|EOT|>
