Abstract
This chapter looks at a special application of depth-first search in order to find cycles in labyrinths, street networks, or networks of social relationships. Sometimes it is very important to find cycles, for example in order to resolve deadlocks where people or jobs wait on each other in a cyclic fashion so that no one can advance. Surprisingly, there is a very simple and elegant way of detecting all cycles in a network.
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.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schlingloff, H. (2011). Cycles in Graphs. In: Vöcking, B., et al. Algorithms Unplugged. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-15328-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15327-3
Online ISBN: 978-3-642-15328-0
eBook Packages: Computer ScienceComputer Science (R0)
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
