Eppstein's algorithm

proper noun

An algorithm that finds a number of shortest paths (allowing cycles) connecting a given pair of vertices in a digraph.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

proper noun
  1. graph theoryAn algorithm that finds a number of shortest paths (allowing cycles) connecting a given pair of vertices in a digraph.

Origin

After US mathematician David Eppstein (born 1963).

Full word history & related roots →
Cite this entry
APA

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

MLA

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

Chicago

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

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