Skip to content

Eppstein's algorithm uses a graph transformation technique. This model can also find the K shortest paths from a given source s to each vertex in the graph, in total time O(m + n log n + kn). Implemented in Python.

Notifications You must be signed in to change notification settings

lppcom/Eppstein-Algorithm-in-Python

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 

Repository files navigation

Eppstein-Algorithm-in-Python

About

Eppstein's algorithm uses a graph transformation technique. This model can also find the K shortest paths from a given source s to each vertex in the graph, in total time O(m + n log n + kn). Implemented in Python.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages