https://github.com/codezizo/dijkstra
https://github.com/codezizo/dijkstra
dijkstra-algorithm implementation of python
Last synced: 9 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/codezizo/dijkstra
- Owner: codezizo
- Created: 2018-05-31T12:23:32.000Z (about 8 years ago)
- Default Branch: master
- Last Pushed: 2018-05-31T12:29:27.000Z (about 8 years ago)
- Last Synced: 2025-04-29T19:16:34.948Z (about 1 year ago)
- Topics: dijkstra-algorithm, implementation, of, python
- Language: Python
- Size: 1000 Bytes
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# dijkstra algorithim
This is a python implementation of Dijkstra:
To be noted that due to the lack of a method in heapq to update priority in python's heapq I opted for a non-optimal O(N) remove and readd nodes in the heap.
This returns a hash with all the distances and their respective paths