Revise the weighted, directed graph in Figure 28-18a by adding a directed edge from D to
Chapter 28, Problem 15(choose chapter or problem)
Revise the weighted, directed graph in Figure 28-18a by adding a directed edge from D to H. Let the weight of this new edge be 3. The resulting graph has two paths from A to H that are cheapest among all paths between these two vertices. Which of these two paths will the algorithm getCheapestPath in Segment 28.24 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