medium10 pts · first answer countsgraphsshortest-pathdijkstra

Route that avoids the steepest climb

A hiker’s "effort" on a route is the largest height difference between two adjacent cells. Which change to Dijkstra finds the minimum-effort route?

A.Use min(dist[u], |h[u] - h[v]|) instead of a sumB.Add the height differences as usualC.Use BFS and count the cellsD.Use max(dist[u], |h[u] - h[v]|) instead of a sum

Discussion 0

Join free to post in the discussion.

Route that avoids the steepest climb

Discussion 0

Related questions