Eppstein's algorithm

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