Efficiency of Shortest - route Algorithms

최단경로(最短經路) Algorithm 의 계산능률(計算能率) 비교(比較)

This paper studies the efficiency of four algorithms in determining the shortest-route length between two specified nodes of a network in which every pair of nodes is connected by two nonnegative length arcs. The efficiency is measured in terms of number of additions and comparisons in computation of the shortest-route length. Also, each algorithm is programmed on the IBM 1130 for solving for example problems, and the computing time is measured for further efficiency comparisons.