Suurballe's algorithm
= Suurballe's algorithm
{wiki=Suurballe's_algorithm}
Suurballe's algorithm is a graph theory algorithm used to find two vertex-disjoint paths between two vertices in a weighted graph. The goal is to find the shortest such paths, which can be particularly useful for applications in network design and routing.