Consider connected and undirected Graph G.
G
shortest path tree for each vertexes of G was given.
if we makes union of all these shorte