A classic algorithm that calculates a least-cost path through a network is ____ algorithm.
a. Dijkstra's maximum-cost c. Turing's longest-path
b. Dijkstra's longest-path d. Dijkstra's least-cost
Answer: D
A classic algorithm that calculates a least-cost path through a network is ____ algorithm.
a. Dijkstra's maximum-cost c. Turing's longest-path
b. Dijkstra's longest-path d. Dijkstra's least-cost
Answer: D