 Shortest-path tree

Given a connected, undirected graph "G", a shortest-path tree rooted at vertex "v" is a spanning tree "T" of "G", such that the path distance from root "v" to any other vertex "u" in "T" is the shortest path distance from "v" to "u" in "G".In connected graphs where shortest paths are well-defined (i.e.