Single-Source Shortest-Path Problem

Given a source node s and a destination t, we want to find the shortest (minimum weight) path from s to t.

En route, we will find the shortest path to all nodes $u\in V$.

Solution is a sequence of nodes $v_1,\ldots,v_l$ such that v₁ = s, v_l = t, and $\sum_{i=1}^{l-1} w((v_i,v_{i+1}))$ is minimized.

Definition: $\delta(u,v)$ is the length of the shortest path from u to v. So, we're looking for a path from s to t whose length is $\delta(s,t)$.

Example graph...