Last active
April 30, 2021 17:06
-
-
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.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment