<｜begin▁of▁sentence｜>### Instruction:
Given a graph with two paths from node 0 to node 2, which pass through the nodes [0, 1, 2] and [0, 10, 2] respectively, how can you compute all the shortest simple paths between node 0 and node 2 using NetworkX?
### 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 simple paths in the graph between nodes 0 and 2
paths = list(nx.all_shortest_paths(G, source=0, target=2))

print(paths)
<|EOT|>
