Abstract
Depth-first search (DFS) and breadth-first search (BFS) are two of the most useful subroutines in graph algorithms. They allow one to search a graph in linear time and compile information about the graph. They differ in that the former uses a stack (LIFO) discipline and the latter uses a queue (FIFO) discipline to choose the next edge to explore.
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
© 1992 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Kozen, D.C. (1992). Depth-First and Breadth-First Search. In: The Design and Analysis of Algorithms. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4400-4_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4400-4_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8757-5
Online ISBN: 978-1-4612-4400-4
eBook Packages: Springer Book Archive