A classic algorithm that calculates a least-cost path through a network is ____ algorithm.
A) Dijkstra's maximum-cost
B) Dijkstra's longest-path
C) Turing's longest-path
D) Dijkstra's least-cost

Question

Quizplus · Accepted Answer

Dijkstra's least-cost algorithm is commonly used to find the shortest path between two points in a network. The algorithm works by selecting the node with the lowest cost from the starting point and moving to its adjacent nodes until the target node is reached. This algorithm is widely used in transportation, logistics, and communication networks to optimize the routing of goods, people, or information.

A Classic Algorithm That Calculates a Least-Cost Path Through a Network