Definitions from Wiktionary (Suurballe's algorithm)

▸ noun:  (computing theory) An algorithm for finding two disjoint paths in a non-negatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length.


▸ Words similar to Suurballe's algorithm
▸ Usage examples for Suurballe's algorithm

▸ Idioms related to Suurballe's algorithm
▸ Wikipedia articles (New!)
▸ Words that often appear near Suurballe's algorithm
▸ Rhymes of Suurballe's algorithm

▸ Invented words related to Suurballe's algorithm