A parent pointer records which node led to another node along the best path found so far. In a table, the parent column sits beside each node’s cost and changes whenever a cheaper route is discovered. section 9.3
Following a trade path
When the poster is processed in Dijkstra’s algorithm, it becomes the parent of the bass guitar and drum set as their costs are established. To recover the final route, follow each node’s parent backward until reaching the starting node. section 9.3
