A **shortest-path tree** is a type of data structure used in graph theory that represents the shortest paths from a single source vertex to all other vertices in a weighted graph. The shortest-path tree is a subtree of the graph and satisfies the property that for any vertex in the tree, the path from the source vertex to that vertex is the shortest possible path in the graph. ### Key Characteristics: 1. **Source Vertex**: The node from which the shortest paths originate.
New to topics? Read the docs here!