onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2025-04-01 19:23:52 +01:00
Code Issues Packages Projects Releases Wiki Activity
grokking-algorithms/chapter_09/README.md
onyx-and-iris 4cd7bb7d18 reorganise directories 
upd chapter_01/binary.py
2025-03-26 01:27:35 +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.