mirror of
https://github.com/onyx-and-iris/grokking-algorithms.git
synced 2025-04-03 04:03:53 +01:00
6 lines
293 B
Markdown
6 lines
293 B
Markdown
# 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.
|