Given a graph G = (V, E), where every edge e has a nonnegative weight w(e), and a source vertex s in V, find the shortest path from s to every other vertex-Given a graph G = (V, E), where every edge e has a nonnegative weight w(e), and a source vertex s in V,　find the shortest path from s to every other vertex