<｜begin▁of▁sentence｜>### Instruction:
Given a weighted graph with edge set [(0, 1, 3.0), (1, 2, 7.5), (2, 3, 2.1), (0, 3, 10.0)], could you compute the shortest path from node 0 to node 3 using the NetworkX all_pairs_dijkstra_path API?
### Response:
import networkx as nx

# Create a weighted graph
G = nx.Graph()
G.add_weighted_edges_from([(0, 1, 3.0), (1, 2, 7.5), (2, 3, 2.1), (0, 3, 10.0)])

# Compute shortest paths between all nodes
all_pairs_paths = dict(nx.all_pairs_dijkstra_path(G))

# Print the shortest path from node 0 to node 3
print('Shortest path from 0 to 3:', all_pairs_paths[0][3])
<|EOT|>
