Suurballe's algorithm

proper noun

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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

proper noun
  1. computerAn 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.

Origin

Devised by John W. Suurballe and published in 1974.

Full word history & related roots →
Cite this entry
APA

Suurballe's algorithm. (n.d.). In WatkinsX Dictionary. Retrieved November 3, 2026, from https://dictionary.watkinsx.com/word/Suurballe's%20algorithm

MLA

“Suurballe's algorithm.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Suurballe's%20algorithm. Accessed November 3, 2026.

Chicago

WatkinsX Dictionary, s.v. “Suurballe's algorithm,” accessed November 3, 2026, https://dictionary.watkinsx.com/word/Suurballe's%20algorithm.

Source: Suurballe's algorithm on Wiktionary, CC BY-SA 4.0.