ISSN:
1436-4646
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract In the last 15 years, a good deal of effort has been devoted to the study of the shortest route problem. More than 200 publications are known but little has been reported concerning relative efficiencies. For a long time the Dijkstra method was considered the most efficient one. Programming work, using different data structures and implementation techniques for several algorithms, has shown that a variant of Moore's method seems to be most efficient for different types of graph structures. The main objective of this paper is to show the strong relationship between an algorithm and its implementation.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01585517