Revise the unweighted, directed graph in Figure 29-15a by adding a directed edge from D to H. The resulting graph has two paths from A to H that are shortest among all paths between these two...

Revise the unweighted, directed graph in Figure 29-15a by adding a directed edge from D to H. The resulting graph has two paths from A to H that are shortest among all paths between these two vertices. Which of these two paths will the algorithm getShortestPath in Segment 29.19 find?