Description: To the adjacent table for the storage structures, to achieve connectivity of undirected graph depth-first and breadth-first traversal. To user-specified node as a starting point, respectively, under the output of each node traversal visit sequence.
To Search:
- [graphserch] - this small procedure is used to implemen
- [tu_de_bian_li] - The adjacency matrix of the graph and tr
- [tu] - Map depth-first traversal, the structure
File list (Check if you may need any files):
tu
..\Debug
..\.....\tu.obj
..\.....\tu.pch
..\.....\tu.pdb
..\.....\vc60.idb
..\.....\vc60.pdb
..\.....\图.obj
..\tu.cpp
..\tu.dsp
..\tu.ncb
..\tu.opt
..\tu.plg
Download