shortest-path algorithm

views updated

shortest-path algorithm An algorithm that is designed essentially to find a path of minimum length between two specified vertices of a connected weighted graph. A good algorithm for this problem was given by E. W. Dijkstra in 1959.