|
project summary
|
Depth First Search
| Title: |
Depth First Search
|
| Author: |
Toshiaki Nishihara and Yasuhiko Minamide
|
| Submission date: |
2004-06-24 |
| 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.
|
|