# 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.