1//! Disjoint-path algorithms.
2//!
3//! - [`suurballe`] — Suurballe's algorithm for a pair of vertex-disjoint shortest paths
4//! of minimum total cost (Dijkstra + reduced-cost residual search).
56pub mod suurballe;
78pub use suurballe::{DisjointPaths, suurballe_vertex_disjoint};