Shortest path forest with topological ordering: An algorithm description in SDL

This short note presents a formal description of a fast and robust shortest path algorithm. Modeled on an algorithm of Pape (1974), it requires less memory store than most algorithms and at the same time permits arc lengths to range between -[chi] and +[chi]. It is described in a machine processable language called SDL. The note opens with a brief introduction to SDL syntax.

MoreLess

Year of publication:	1980
Authors:	Dial, Robert ; Glover, Fred ; Karney, David ; Klingman, Darwin
Published in:	Transportation Research Part B: Methodological. - Elsevier, ISSN 0191-2615. - Vol. 14.1980, 4, p. 343-347
Publisher:	Elsevier

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005228078