Module path 

Disjoint-path algorithms.

• suurballe — Suurballe’s algorithm for a pair of vertex-disjoint shortest paths of minimum total cost (Dijkstra + reduced-cost residual search).

Re-exports

pub use suurballe::DisjointPaths;

pub use suurballe::suurballe_vertex_disjoint;

Modules

suurballe

Suurballe’s algorithm for a pair of vertex-disjoint shortest paths.