Graph Traversals and Algorithms
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.
KeywordsSpan Tree Adjacent Node Simple Cycle Abstract Data Type Graph Traversal
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