Revise the unweighted, directed graph in Figure 28-15a by adding a directed edge from D
Chapter 28, Problem 13(choose chapter or problem)
Revise the unweighted, directed graph in Figure 28-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 28.19 find?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer