onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2025-01-18 16:50:53 +00:00
Code Issues Packages Projects Releases Wiki Activity
d552050f7e
grokking-algorithms/chapter9/README.md
onyx-and-iris 1da4a16ec8 add some notes
2024-01-19 17:21:42 +00:00

275 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.
  • Priority queue + min heap is optimal when compared to a function that operates on a list.