What is the least-cost solution for getting from point A to point B?
Given a weighted, directed graph G = (V, E) with edge weights w and a path
definition of p =
<v0, v1, .., vk> with weight
, find the shortest path weight from
vertex u to vertex v
Breadth-First Search worked on unweighted (unit weight) graphs.