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.

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.

License

BSD License

Topics

Session Depth-First-Search

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{https://isa-afp.org/entries/Depth-First-Search.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: