Abstract
In this chapter the fundamental searching algorithms for connected,especially for finite connected,R- and C-graphs are discussed. They are mainly given by programs written in Pidgin Programming Language (PPL). The algorithms are shown to be correct, the types of automata able to implement them are characterized, and the corresponding time complexities are estimated.
Über uns glänzten die Sterne,und die Visionen der Bibliothek lagen weit in der Ferne. “Wie schön ist die Welt und wie gräßlich sind Labyrinthe ! ” rief ich erleichtert aus. “Wie schön wäre die Welt,wenn es eine Regel für die Begehung von Labyrinthen gäbe!” sagte William.
Umberto Eco, Der Name der Rose
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
© 1989 BSB B. G. Teubner Verlagsgesellschaft, Leipzig
About this chapter
Cite this chapter
Hemmerling, A. (1989). Searching Algorithms. In: Labyrinth Problems. Teubner-Texte zur Mathematik, vol 114. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-94560-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-322-94560-0_3
Publisher Name: Vieweg+Teubner Verlag, Wiesbaden
Print ISBN: 978-3-322-94561-7
Online ISBN: 978-3-322-94560-0
eBook Packages: Springer Book Archive