onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2024-09-27 11:07:03 +01:00
Code Issues Packages Projects Releases Wiki Activity
1d22356ce5
grokking-algorithms/chapter9/README.md
onyx-and-iris 3fe14b8ac0 clean up repo. 
add more notes
2024-02-06 21:53:17 +00:00

293 B
Raw Blame History

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.