Skip to main content
SpringerLink
Log in

Calculating a path algorithm

  • Conference paper
  • First Online:
Mathematics of Program Construction (MPC 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 669))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.C. Backhouse. Calculating the Floyd/Warshall path algorithm. Eindhoven University of Technology, Department of Computing Science, 1992.

    Google Scholar 

  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. B.A. Carré. Graphs and Networks. Oxford University Press, 1979.

    Google Scholar 

  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. E.W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269–271, 1959.

    Article  Google Scholar 

  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. R.E. Tarjan. A unified approach to path problems. Journal of the Association for Computing Machinery, 28:577–593, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600, MB Eindhoven, The Netherlands

    Roland C. Backhouse & A. J. M. van Gasteren

Authors
  1. Roland C. Backhouse
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. J. M. van Gasteren
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

R. S. Bird C. C. Morgan J. C. P. Woodcock

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Backhouse, R.C., van Gasteren, A.J.M. (1993). Calculating a path algorithm. In: Bird, R.S., Morgan, C.C., Woodcock, J.C.P. (eds) Mathematics of Program Construction. MPC 1992. Lecture Notes in Computer Science, vol 669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56625-2_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-56625-2_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56625-0

  • Online ISBN: 978-3-540-47613-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation