Module johnson 

Johnson’s algorithm implementation.

Re-exports

pub use super::BoundedMeasure;

pub use super::NegativeCycle;

Functions

johnson

Johnson algorithm for all pairs shortest path problem.

johnson_reweight 🔒

Add a virtual node to the graph with oriented edges with zero weight to all other vertices, and then run SPFA from it. The found distances will be used to change the edge weights in Dijkstra’s algorithm to make them non-negative.