Ahuja et al. found that using a van Emde Boas tree reduces the complexity of this problem to “big O of m log log C” when certain values are bounded by C. For hidden Markov models, the Viterbi algorithm essentially solves this problem with probabilistic weights added. Fredman and Tarjan used Fibonacci heaps to find the asymptotically fastest known algorithm for one form of this problem, improving on Johnson’s (10[1])algorithm. The Floyd–Warshall (10[1])algorithm solves this problem for multiple sources. (-5[1])A priority queue is typically (10[1])used to store unvisited items in a “big O (-5[1])of (10[1]-5[1])m log n” (-5[2])algorithm for this task. (-5[1])The Bellman–Ford algorithm works (10[1])for this problem (10[1])even if edge weights are negative, unlike Dijkstra’s (10[1]-5[1])algorithm. (10[1])For 10 (10[1])points, name this problem of finding the minimum-distance route between (10[1])two (-5[1])vertices of a graph. ■END■ (10[7]0[5])