Depth First Search

Toshiaki Nishihara and Yasuhiko Minamide

June 24, 2004


Depth-first search of a graph is formalized with recdef. It is shown that it visits all of the reachable nodes from a given list of nodes. Executable ML code of depth-first search is obtained using the code generation feature of Isabelle/HOL.
BSD License


Theories of Depth-First-Search