<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edge set [(0, 1), (1, 2), (0, 10), (10, 2)], what are all the shortest simple paths between node 0 and node 2?
### Response:
import networkx as nx

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

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

# Print the paths
print(paths)
<|EOT|>
