diff options
| author | Tatsuya Shimoda <tacoo@users.noreply.github.com> | 2022-05-17 13:54:53 +0900 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2022-05-16 21:54:53 -0700 |
| commit | b7d65ffc7183e9a01cdc07b79f8f06403cc4dda4 (patch) | |
| tree | bb55d0c8ca4764e2dfd61e02dac74c33f531b7c0 | |
| parent | 26b7de005ac562786f72b24a73af5a59bbab6953 (diff) | |
| download | networkx-b7d65ffc7183e9a01cdc07b79f8f06403cc4dda4.tar.gz | |
DOC: remove note re: non-existant param (#5648)
| -rw-r--r-- | networkx/algorithms/shortest_paths/weighted.py | 2 |
1 files changed, 0 insertions, 2 deletions
diff --git a/networkx/algorithms/shortest_paths/weighted.py b/networkx/algorithms/shortest_paths/weighted.py index 89bba278..4ab91f92 100644 --- a/networkx/algorithms/shortest_paths/weighted.py +++ b/networkx/algorithms/shortest_paths/weighted.py @@ -899,8 +899,6 @@ def dijkstra_predecessor_and_distance(G, source, cutoff=None, weight="weight"): pred, distance : dictionaries Returns two dictionaries representing a list of predecessors of a node and the distance to each node. - Warning: If target is specified, the dicts are incomplete as they - only contain information for the nodes along a path to target. Raises ------ |