rustworkx_directed_graph_dijkstra_shortest_path.py

1import rustworkx as rx
2
3# Create a new directed graph
4graph = rx.PyDiGraph()
5
6# Add nodes to the graph
7node_a = graph.add_node("A")
8node_b = graph.add_node("B")
9node_c = graph.add_node("C")
10
11# Add edges between nodes with weights
12graph.add_edge(node_a, node_b, 1.5)
13graph.add_edge(node_b, node_c, 2.0)
14graph.add_edge(node_a, node_c, 4.0)
15
16# Calculate the shortest path between node A and node C
17shortest_path = rx.digraph_dijkstra_shortest_paths(graph, node_a, node_c, lambda x: x)
18
19print(f"Shortest path from A to C: {shortest_path}")