Description: Graph traversal, since the graph of any vertex can be with the rest of the vertices adjacent, so a visit to a vertex, you may search along a particular path then back to the vertices. In order to avoid the same vertex have been visited many times, in the process of traversal map must note each vertex visited. Depth-first search from a map of a top-v point of view, access to this vertex, to be followed by visits from v are not adjacent to the point of depth-first traversal Fig. Ergodic map is essentially the process of search for each vertex the course of its adjacent points. Their time spent will depend on the used storage structure.
To Search:
- [1] - 1) grasp the linear form the basic conce
- [3] - Learn VC++ AppWizard process and use the
- [tubianliyingyong] - Figure traversal application. For curric
File list (Check if you may need any files):
Download