Node Sequence # dy Pv A O (start) 0 NIL B 3 8 A 6(or 7) 12 D 4 9 G E 7(or 6) 12 F 5 G 2 7 H H 1 4 A Tree Cost Construct the shortest path tree by Dijkstra's algorithm on the same graph, where A is the starting node. F 10 A 7 3 18 B D 10 2 25 E Dijkstra's algorithm for the shortest path tree T dy - 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