<｜begin▁of▁sentence｜>### Instruction:
As a dedicated grant writer working on a proposal to secure funding for developing a local transportation network, we're in the process of evaluating various routes and their efficiency for inclusion in our application. Our current network analysis has revealed that there are two potential routes connecting our central hub, node 0, to a critical access point, node 2. One possible route is a direct connection through node 1, forming the path 0-1-2, while an alternative bypasses this through node 10, creating the path 0-10-2.

For our proposal, we need to ensure that we are advocating for the most efficient pathways to maximize the potential funding we can obtain. Can we employ NetworkX to calculate all the shortest simple paths between our central hub, node 0, and the access point, node 2, keeping in mind these two distinct routes? This data will critically inform our proposal, demonstrating the network's optimization and the thorough research backing our request for funding.
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_path([0, 1, 2])
G.add_path([0, 10, 2])

# Compute all shortest paths between nodes
paths = list(nx.all_shortest_paths(G, source=0, target=2))

# Print all shortest paths
print(paths)
<|EOT|>
