onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2024-11-15 17:30:52 +00:00
Code Issues Packages Projects Releases Wiki Activity
ab09aa5269
grokking-algorithms/chapter9
History
onyx-and-iris ab09aa5269 add visited set
2024-02-19 00:03:44 +00:00
..
with_heap add visited set 2024-02-19 00:03:44 +00:00
with_list_function whitespace 2023-12-20 22:06:29 +00:00
dijkstra1.png add chapter9 exercises 2023-12-19 15:47:26 +00:00
dijkstra2.png add chapter9 exercises 2023-12-19 15:47:26 +00:00
dijkstra3.png add chapter9 exercises 2023-12-19 15:47:26 +00:00
rama.py add chapter9 exercises 2023-12-19 15:47:26 +00:00
README.md clean up repo. 2024-02-06 21:53:17 +00:00

README.md

Shortest path for weighted graph (cost associated edges)

  • Dijkstra's algorithm works when all weights are non-negative
    • If there are negative weights use Bellman-Ford.
  • The book demonstrates a function that operates on a list. Priority queue + min heap added for completeness.