diff options
| author | Dan Schult <dschult@colgate.edu> | 2021-11-11 13:26:35 -0500 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-11-11 13:26:35 -0500 |
| commit | 1646a5fe664d902f3d4ed9d282a7868d82e0be6f (patch) | |
| tree | 3d90d4a8ed51aca05d41a8671aaf700029c4095a /doc/reference/algorithms | |
| parent | 3caf6f966efeb50bbd6421d824d8df0a455e40a1 (diff) | |
| download | networkx-1646a5fe664d902f3d4ed9d282a7868d82e0be6f.tar.gz | |
Add a function to find the negative cycle using bellman_ford (#5089)
* add code to find negative cycle if bellman_ford detects one
* Switch to separate function for finding a negative weight cycle
* make phrase for negative cycles consistent
(no "cost" of "weight" -- just negative cycle)
* fix docstring formatting
* Update networkx/algorithms/shortest_paths/weighted.py
Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>
* clean up multiple return type code and example printing
* First pass for splitting inner_bellman_ford function
* run the correct version of black :}
* Fix docstring
Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>
Diffstat (limited to 'doc/reference/algorithms')
| -rw-r--r-- | doc/reference/algorithms/shortest_paths.rst | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/doc/reference/algorithms/shortest_paths.rst b/doc/reference/algorithms/shortest_paths.rst index daf1c2d3..935622e4 100644 --- a/doc/reference/algorithms/shortest_paths.rst +++ b/doc/reference/algorithms/shortest_paths.rst @@ -55,6 +55,7 @@ Advanced Interface bellman_ford_predecessor_and_distance negative_edge_cycle + find_negative_cycle goldberg_radzik johnson |