<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with edges [(0, 1), (0, 2), (1, 3), (2, 3)] and edge weights [1, 1, 2, 2], can you use GraphBase.get_shortest_paths function in igraph to calculate and print the shortest paths from vertex 0 to all other vertices?
### Response:
import igraph as ig

# Load a graph
graph = ig.Graph(edges=[(0, 1), (0, 2), (1, 3), (2, 3)], directed=False)

# Define weights for the edges
graph.es['weight'] = [1, 1, 2, 2]

# Calculate the shortest path from vertex 0 to all other vertices
shortest_paths = graph.get_shortest_paths(v=0, weights='weight', mode='out', output='vpath')

# Print the shortest paths
for path in shortest_paths:
    print(path)
<|EOT|>
