Construct the shortest path tree by Dijkstra's algorithm on the same graph, where A is the starting node. 10 A 8 4 18 B D 10 H 25 E Dijkstra's algorithm for the shortest path tree T dv - Shortest path length from source node s to v py-node in the partial tree to which node v is connected Sequence # is the order nodes are added to T Node Sequence # dy Pv A O (start) 0 NIL B E G Tree Cost