Depth First Search

Toshiaki Nishihara and Yasuhiko Minamide

June 24, 2004

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


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


Session Depth-First-Search