<｜begin▁of▁sentence｜>### Instruction:
Suppose you are orchestrating the itinerary for a series of product pickups along a linear route of stores, labeled from Store 0 through Store 4, such that each store is only visited once and the path between each consecutive store is of equal distance. In this setup, using NetworkX, how would you go about calculating the minimal distance required for a delivery truck to travel from the starting point at Store 0 to each of the subsequent stores along this route?
### Response:
import networkx as nx

# Create a graph
G = nx.path_graph(5)

# Compute shortest path lengths from source node 0 to all reachable nodes
lengths = nx.single_source_shortest_path_length(G, 0)

# Output the shortest path lengthsor node in lengths:
    print(f"{node}: {lengths[node]}")
<|EOT|>
