grokking-algorithms/chapter9/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.
add some notes 2024-01-19 17:21:42 +00:00			`# 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.`
clean up repo. add more notes 2024-02-06 21:53:17 +00:00			`- The book demonstrates a function that operates on a list. Priority queue + min heap added for completeness.`