diff options
| author | Dan Schult <dschult@colgate.edu> | 2019-03-08 13:09:44 +1100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2019-03-08 13:09:44 +1100 |
| commit | 89d9b045c8362e23674a6e36d7bf33f6490cee49 (patch) | |
| tree | c91dbea8d4c92f015f6ff1773224422217640aac | |
| parent | 6bdcdcf07b9d84911697012a2c5833c62fa25992 (diff) | |
| download | networkx-dschult-patch-1.tar.gz | |
Fix error message for single_target_shortest_pathdschult-patch-1
Fixes #3338
| -rw-r--r-- | networkx/algorithms/shortest_paths/unweighted.py | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/networkx/algorithms/shortest_paths/unweighted.py b/networkx/algorithms/shortest_paths/unweighted.py index 3610cced..0daf6de0 100644 --- a/networkx/algorithms/shortest_paths/unweighted.py +++ b/networkx/algorithms/shortest_paths/unweighted.py @@ -413,7 +413,7 @@ def single_target_shortest_path(G, target, cutoff=None): shortest_path, single_source_shortest_path """ if target not in G: - raise nx.NodeNotFound("Target {} not in G".format(source)) + raise nx.NodeNotFound("Target {} not in G".format(target)) def join(p1, p2): return p2 + p1 |