Calculating a path algorithm

  • Roland C. Backhouse
  • A. J. M. van Gasteren
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 669)


A calculational derivation is given of an abstract path algorithm, one instance of the algorithm being Dijkstra's shortest-path algorithm, another being breadth-first/depth-first search of a directed graph. The basis for the derivation is the algebra of regular languages.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R.C. Backhouse. Calculating the Floyd/Warshall path algorithm. Eindhoven University of Technology, Department of Computing Science, 1992.Google Scholar
  2. 2.
    R.C. Backhouse and B.A. Carré. Regular algebra applied to path-finding problems. Journal of the Institute of Mathematics and its Applications, 15:161–186, 1975.Google Scholar
  3. 3.
    B.A. Carré. Graphs and Networks. Oxford University Press, 1979.Google Scholar
  4. 4.
    P. Chisholm. Calculation by computer. In Third International Workshop Software Engineering and its Applications, pages 713–728, Toulouse, France, December 3–7 1990. EC2.Google Scholar
  5. 5.
    E.W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269–271, 1959.CrossRefGoogle Scholar
  6. 6.
    E.W. Dijkstra and W.H.J. Feijen. Een Methode van Programmeren. Academic Service, Den Haag, 1984. Also available as A Method of Programming, Addison-Wesley, Reading, Mass., 1988.Google Scholar
  7. 7.
    R.E. Tarjan. A unified approach to path problems. Journal of the Association for Computing Machinery, 28:577–593, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Roland C. Backhouse
    • 1
  • A. J. M. van Gasteren
    • 1
  1. 1.Department of Mathematics and Computing ScienceEindhoven University of TechnologyMB EindhovenThe Netherlands

Personalised recommendations