Depth First Search (Q7361225)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Depth-First-Search
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Depth First Search |
AFP entry Depth-First-Search |
Statements
Toshiaki Nishihara
0 references
Yasuhiko Minamide
0 references
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.
0 references
24 June 2004
0 references
Depth First Search (English)
0 references
