<｜begin▁of▁sentence｜>### Instruction:
Given a directed weighted graph with edge set [("A", "B", 1), ("B", "C", 2), ("A", "C", 5)], can you use the bellman_ford_path function to find the shortest path from node A to node C?
### Response:
import networkx as nx

# Create a weighted graph
G = nx.DiGraph()
G.add_weighted_edges_from([("A", "B", 1), ("B", "C", 2), ("A", "C", 5)])

# Get the shortest path from A to C
path = nx.bellman_ford_path(G, "A", "C")
print("Shortest path from A to C:", path)
<|EOT|>
