Word.ws English Dictionary

Suurballe's algorithm

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.

Proper noun

Suurballe's algorithm

  1. 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.

Origin of Suurballe's algorithm

Devised by John W. Suurballe and published in 1974.

Questions about Suurballe's algorithm

What does Suurballe's algorithm mean?
Suurballe's algorithm means 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.
What part of speech is Suurballe's algorithm?
Suurballe's algorithm is a proper noun.

Words near Suurballe's algorithm in the dictionary

  1. sutureless
  2. suturelike
  3. sutures
  4. suturing
  5. SUU
  6. Suurballe's algorithm
  7. suuure
  8. SUV
  9. Suva
  10. Suvadive
  11. Suvali

Source and license

Adapted from Wiktionary: Suurballe's algorithm (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Suurballe's algorithm.” Word.ws, https://word.ws/suurballe%27s_algorithm. Based on Wiktionary, CC BY-SA 4.0.