- Category:
- Document
- Tags:
-
[WORD]
- File Size:
- 8kb
- Update:
- 2012-11-26
- Downloads:
- 0 Times
- Uploaded by:
- 周天行
Description: Figure traverse the depth and breadth of First create a non-directed graph, vertex with a one-dimensional array to store the arc with a two-dimensional array to store non-adjacent vertices between the infinite set. Boolean function, set deep traversal vertices visited vertex boolean value true recursive call DFS function. Breadth traversal, combined with the queue storage traversal.
To Search:
File list (Check if you may need any files):
bianli.doc
Download