title: Verify the shortest path of a graph
body: <p>[Edited] 
  For a graph G, we are given the shortest path distances from a vertex V1 to every other vertex of the graph. How can we verify that the distance given are the actual shortest paths that one can find (by Dijkstra's or some other algorithm)? and its running time?</p>