Cycles in Graphs

  • Holger Schlingloff


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.


Original Reference Binary Decision Diagram Additional Edge Successor Node Strongly Connect Component 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Holger Schlingloff
    • 1
  1. 1.Humboldt-Universität zu BerlinBerlinGermany

Personalised recommendations