We have already encountered the notions of connectivity, strong connectivity, and k-connectivity; and we know an efficient method for determining the connected components of a graph: breadth first search. In the present chapter, we mainly treat algorithmic questions concerning k-connectivity and strong connectivity. To this end, we introduce a further important strategy for searching graphs and digraphs (besides BFS), namely depth first search. In addition, we present various theoretical results, such as characterizations of 2-connected graphs and of edge connectivity.
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.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Connectivity and Depth First Search. In: Graphs, Networks and Algorithms. Algorithms and Computation in Mathematics, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72780-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-72780-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72779-8
Online ISBN: 978-3-540-72780-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)