modified doc in weighted.py

networkx · Nov 26, 2023 · aaa36b7 · aaa36b7
1 parent 2abd434
commit aaa36b7
Showing 1 changed file with 1 addition and 0 deletions.
diff --git a/nx_parallel/algorithms/shortest_paths/weighted.py b/nx_parallel/algorithms/shortest_paths/weighted.py
@@ -39,6 +39,7 @@ def all_pairs_bellman_ford_path(G, weight="weight"):
 
     Examples
     --------
+    >>> import networkx as nx
     >>> G = nx.Graph()
     >>> G.add_weighted_edges_from([(1, 0, 1), (1, 2, 1), (2, 0, 3)])
     >>> path = dict(nx.all_pairs_bellman_ford_path(G))