This algorithm applies for cases where all edge weights are
non-negative. This algorithm finds the shortest path from a given
vertex v to other vertices on the graph. At the beginning of an
iteration, have a set of vertices S to which we know the shortest
path from 
grow set by one. This algorithm exhibits
dynamic programming-like strategy.