Definitions from Wiktionary (Eppstein's algorithm)
▸ noun: (graph theory) An algorithm that finds a number of shortest paths (allowing cycles) connecting a given pair of vertices in a digraph.
▸ Words similar to Eppstein's algorithm
▸ Usage examples for Eppstein's algorithm
▸ Idioms related to Eppstein's algorithm
▸ Wikipedia articles (New!)
▸ Words that often appear near Eppstein's algorithm
▸ Rhymes of Eppstein's algorithm
▸ Invented words related to Eppstein's algorithm
▸ noun: (graph theory) An algorithm that finds a number of shortest paths (allowing cycles) connecting a given pair of vertices in a digraph.
▸ Words similar to Eppstein's algorithm
▸ Usage examples for Eppstein's algorithm
▸ Idioms related to Eppstein's algorithm
▸ Wikipedia articles (New!)
▸ Words that often appear near Eppstein's algorithm
▸ Rhymes of Eppstein's algorithm
▸ Invented words related to Eppstein's algorithm