Skip to main content
Springer Nature Link
Log in

Functional Graph Algorithms with Depth-First Search (Preliminary Summary)

  • Chapter
Functional Programming, Glasgow 1993

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 72 Accesses

Abstract

Performing a depth-first search of a graph is one of the fundamental approaches for solving a variety of graph algorithms. Implementing depth- first search efficiently in a pure functional language has only become possible with the advent of imperative functional programming. In this paper we mix the techniques of pure functional programming in the same cauldron as depth-first search to yield a more lucid approach to viewing a variety of graph algorithms. This claim will be illustrated with several examples.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Thomas H. Corman, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, Massachusetts, 1990.

    Google Scholar 

  2. Rachel Harrison. Abstract data types in Standard ML. John Wiley and Sons, 1993.

    Google Scholar 

  3. Ian Holyer. Functional programming with Miranda. Pitman, London, 1991.

    Google Scholar 

  4. John E. Hopcroft and Robert E. Tarjan. Algorithm 447: Efficient algorithms for graph manipulation. Communications of the ACM, 16(6):372–378, June 1973.

    Article  Google Scholar 

  5. Paul Hudak, Simon L. Peyton Jones, Philip Wadler, Arvind, Brian Boutel, Jon Fairbairn, Joseph Fasel, María M. Guzmán, Kevin Hammond, John Hughes, Thomas Johnsson, Richard Kieburtz, Rishiyur S. Nikhil, Will Partain, and John Peterson. Report on the functional programming language Haskell, Version 1.2. ACM SIGPLAN Notices, 27(5), May 1992.

    Google Scholar 

  6. John Launchbury. Lazy imperative programming. In Workshop on State in Programming Languages, ACM SIGPLAN, pages 46–56, Copenhagen, Denmark, June 1993.

    Google Scholar 

  7. L. C. Paulson. ML for the working programmer. Cambridge University Press, Cambridge, 1991.

    Google Scholar 

  8. Simon L. Peyton Jones and Philip Wadler. Imperative functional programming. In 20’th Symposium on Principles of Programming Languages, ACM, Charleston, North Carolina, January 1993.

    Google Scholar 

  9. M. Sharir. A strong-connectivity algorithm and its applications in data flow analysis. Computers and mathematics with applications, 7(1), 1981.

    Google Scholar 

  10. Robert E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal of Computing, 1(2): 146–160, June 1972.

    Article  MathSciNet  MATH  Google Scholar 

  11. Philip Wadler. The essence of functional programming (invited talk). In 19’th Symposium on Principles of Programming Languages, ACM, Santa Fe, New Mexico, January 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Glasgow, Glasgow, G12 8QQ, Scotland, UK

    David J. King & John Launchbury

Authors
  1. David J. King
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Launchbury
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, The University, Glasgow, G12 8QQ, Scotland

    John T. O’Donnell PhD  & Kevin Hammond PhD  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1994 British Computer Society

About this chapter

Cite this chapter

King, D.J., Launchbury, J. (1994). Functional Graph Algorithms with Depth-First Search (Preliminary Summary). In: O’Donnell, J.T., Hammond, K. (eds) Functional Programming, Glasgow 1993. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3236-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3236-3_12

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19879-6

  • Online ISBN: 978-1-4471-3236-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics