Single-Source Shortest Paths (Dijkstra’s algorithm)
Using BFS, solved problem of finding shortest path from s to t.
What if edges have associated costs or distances? (BFS problem assumes edge costs are all 1.)
Assume each edge (u,v) has nonnegative cost c(u,v).
Define the cost of a path = total costs of all edges on path.
Problem: Find, for each vertex v, the least cost path from s to v.