Description: Followed by depth-first search strategy is to search " Shenzhen" to search for plans. In depth-first search for the newly discovered node, if it has not found this as a starting point over the edge, along the edge to continue the search indefinitely. When node v all edges have been searching for, the search will go back to the node v has found that the only edge nodes. This process has been carried out to have been found up from the source node until all nodes. If there are still undiscovered node, then choose one node as the source and repeat the above process, the whole process repeated until all nodes have been found so far
To Search:
- [6.7.1] - 1. Graph using adjacency list of the sto
- [searching] - This is a 2 on the implementation of sea
File list (Check if you may need any files):
深度优先.doc
Download