Annals of Operations Research

, Volume 13, Issue 1, pp 1–79

Shortest path algorithms

  • Giorgio Gallo
  • Stefano Pallottino
Chapter I Shortest Paths

DOI: 10.1007/BF02288320

Cite this article as:
Gallo, G. & Pallottino, S. Ann Oper Res (1988) 13: 1. doi:10.1007/BF02288320

Abstract

Theshortest path problem is considered from a computational point of view. Eight algorithms which solve theshortest path tree problem on directed graphs are presented, together with the results of wide-ranging experimentation designed to compare their relative performances on different graph topologies. The focus of this paper is on the implementation of the different data structures used in the algorithms. A "Pidgin Pascal" description of the algorithms is given, containing enough details to allow for almost direct implementation in any programming language. In addition, Fortran codes of the algorithms and of the graph generators used in the experimentation are provided on the diskette.

Copyright information

© J.C. Baltzer AG, Scientific Publishing Company 1988

Authors and Affiliations

  • Giorgio Gallo
    • 1
  • Stefano Pallottino
    • 2
  1. 1.Department of InformaticsUniversity of PisaPisaItaly
  2. 2.I.A.C., National Research CouncilRomaItaly
  3. 3.Department of InformaticsUniversity of PisaPisaItaly