Depth-First Search (Ariadne & Co.)

  • Michael Dom
  • Falk Hüffner
  • Rolf Niedermeier

Abstract

This chapter considers how can one find the exit out of a labyrinth without ending up walking in a cycle or walking multiple times along the same path. The authors show that this problem can be solved using a fundamental method called depth-first search, if it is possible to set marks, such as a line with a piece of chalk, along the way. Interestingly, the depth-first search method also works if one wants to systematically explore a part of the World-Wide Web or if one wants to generate a labyrinth.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Michael Dom
    • 1
  • Falk Hüffner
    • 2
  • Rolf Niedermeier
    • 3
  1. 1.Friedrich-Schiller-Universität JenaJenaGermany
  2. 2.Humboldt-Universität zu BerlinBerlinGermany
  3. 3.Technische Universität BerlinBerlinGermany

Personalised recommendations