Skip to content

Instantly share code, notes, and snippets.

@tommct
Last active April 30, 2021 17:06
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save tommct/731875648fdfeebc3118bb5c51c65993 to your computer and use it in GitHub Desktop.
Save tommct/731875648fdfeebc3118bb5c51c65993 to your computer and use it in GitHub Desktop.
Generic Dijkstra's shortest paths implementation in Python using a priority queue with callback functionality as it visits nodes.
Display the source blob
Display the rendered blob
Raw
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment