Depth First Search

Toshiaki Nishihara and Yasuhiko Minamide

24 June 2004

Abstract

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

Topics

Theories

Cite

×
@article{Depth-First-Search-AFP,
  author  = {Toshiaki Nishihara and Yasuhiko Minamide},
  title   = {Depth First Search},
  journal = {Archive of Formal Proofs},
  month   = June,
  year    = 2004,
  note    = {\url{http://isa-afp.org/entries/Depth-First-Search.html},
            Formal proof development},
  ISSN    = {2150-914x},
}
Download