Abstract
Most algorithms on graphs require a systematic method of visiting the vertices of a graph. Two basic and common methods of exploring a graph are the generalization to graphs of the preorder traversal and the top-down traversal of trees.
A good idea has a way of becoming simpler and solving problems other than that for which it was intended.
—Robert E. Tarjan [299]
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Valiente, G. (2002). Graph Traversal. In: Algorithms on Trees and Graphs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04921-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-04921-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07809-5
Online ISBN: 978-3-662-04921-1
eBook Packages: Springer Book Archive