<｜begin▁of▁sentence｜>### Instruction:
As a supply chain analyst working for a retail company, you are tasked with analyzing and optimizing the supply chain processes and logistics for efficiency and cost-effectiveness. You have been given a directed graph representing the distribution network within the company. The graph has the edge set [(0, 1), (0, 2), (1, 3), (2, 3)], representing the connections between different warehouse locations. Using the igraph API, you need to compute all the shortest paths from warehouse 0 to every other reachable warehouse in the network.
### Response:
import igraph as ig

# create a graph with predefined edges
g = ig.Graph(edges=[(0, 1), (0, 2), (1, 3), (2, 3)])

# calculate all shortest paths from vertex 0 to all other nodes
g_all_shortest_paths = g.get_all_shortest_paths(v=0, to=None, weights=None, mode='ALL')

# print all of the shortest paths
for path in g_all_shortest_paths:
    print(path)
<|EOT|>
