Skip to main content
SpringerLink
Log in
Book cover

Abstract Data Types and Algorithms pp 281–294Cite as

Graph Traversals and Algorithms

  • Chapter

  • 78 Accesses

Part of the book series: Macmillan Computer Science Series

Abstract

In this chapter we will discuss two systematic and structured methods of traversing the nodes and arcs of a graph. These traversal techniques can then be used as a powerful algorithm design tool on graph data types. These are indeed generalisations of the tree traversal methods which were used as a basis of efficient algorithms on trees.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   59.99
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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographic Notes and Further Reading

  • Aho, A. V., Hopcroft, J. E. and Ullman, J. D. (1983). Data Structures and Algorithms, Addison-Wesley, Reading, Massachusetts.

    Google Scholar 

  • Carré, B. (1979). Graphs and Networks, Oxford University Press.

    Google Scholar 

  • Christofides, N. (1975). Graph Theory: An Algorithmic Approach, Academic Press, London and New York.

    Google Scholar 

  • Evans, S. (1980). Graph Algorithms, Computer Science Press, Rockville, California.

    Google Scholar 

  • Ford, L. R. and Fulkerson, D. R. (1962). Flows in Networks, Princeton University Press, Princeton, New Jersey.

    Google Scholar 

  • Gotlieb, C. C. and Gotlieb, L. R. (1978). Data Types and Data Structures, Prentice-Hall, Englewood Cliffs, New Jersey.

    Google Scholar 

  • Hu, T. C. (1982). Combinatorial Algorithms, Addison-Wesley, Reading, Massachusetts.

    Google Scholar 

  • Papadimitriou, C. H. and Steiglitz, K. (1982). Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, New Jersey.

    Google Scholar 

  • Tarjan, R. (1972). ‘Depth first search and linear graph algorithms’, SIAM Journal of Computing, Vol. 1, No. 2, June.

    Google Scholar 

  • Wirth, N. (1976). Algorithms + Data Structures, Prentice-Hall, Englewood Cliffs, New Jersey.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. British Telecom Research Laboratories, Scottish Mutual House, Lower Brook Street, Ipswich, UK

    Manoochehr Azmoodeh

Authors
  1. Manoochehr Azmoodeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Copyright information

© 1990 Manoochehr Azmoodeh

About this chapter

Cite this chapter

Azmoodeh, M. (1990). Graph Traversals and Algorithms. In: Abstract Data Types and Algorithms. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-21151-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-349-21151-7_10

  • Publisher Name: Palgrave, London

  • Print ISBN: 978-0-333-51210-4

  • Online ISBN: 978-1-349-21151-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation