Eppstein's algorithm

From Wiktionary, the free dictionary

Jump to navigation Jump to search

English

Etymology

After US mathematician David Eppstein (born 1963).

Proper noun

Eppstein 's algorithm

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

Retrieved from "https://en.wiktionary.org/w/index.php?title=Eppstein%27s_algorithm&oldid=77947821"

Hidden categories: