<｜begin▁of▁sentence｜>### Instruction:
Assuming we have a simple path graph with nodes [0, 1, 2, 3, 4] and edges [(0,1), (1,2), (2,3), (3,4)], can you find the shortest path from node 0 to node 4 using NetworkX's single_source_shortest_path function?
### Response:
import networkx as nx

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

# Compute the shortest path between source and all other reachable nodes
path = nx.single_source_shortest_path(G, 0)

# Print the shortest path to node 4
print(path[4])
<|EOT|>
