An important graph problem is the * shortest path*
problem, namely to find a path from a start node to a goal node such
that the sum of weights along the path is minimized. We will assume
that all weights are non-negative.

Shortest path * routing* algorithms are used by web
sites that suggest driving directions, such as MapQuest.