Description: Data structure traversal algorithm is the most common method of operation is the basis for all other algorithms. Traverse the graph than the linear form, the structure of the tree traversal algorithm to complex, focusing on the discussion of graph traversal algorithms, a more general significance. Graph traversal is from a specified vertex graph traversal starting as a starting point, according to a certain search path traversal, all vertices of the graph for a visit only the process. Under the direction of the search path is different graph traversal methods can be divided into depth-first search traversal and breadth-first search traversal, but also according to different methods of preparation method, can be divided into non-recursive traversal algorithms and recursive traversal algorithms.
To Search:
File list (Check if you may need any files):
图的遍历算法设计\图的遍历算法设计-源程序\4.cpp
................\.......................\bianlitu.dsp
................\.......................\bianlitu.dsw
................\.......................\bianlitu.ncb
................\.......................\bianlitu.opt
................\.......................\bianlitu.plg
................\.......................\Debug\4.obj
................\.......................\.....\bianlitu.exe
................\.......................\.....\bianlitu.ilk
................\.......................\.....\bianlitu.opt
................\.......................\.....\bianlitu.pch
................\.......................\.....\bianlitu.pdb
................\.......................\.....\vc60.idb
................\.......................\.....\vc60.pdb
................\图的遍历算法设计.doc
................\................-源程序\Debug
................\图的遍历算法设计-源程序
图的遍历算法设计
Download