Figure 4: Single-source/shortest-paths spanning tree (Dijkstra's algorithm) gives the shortest paths from the starting point to all other nodes.