- Category:
- Data structs
- Tags:
-
[WORD]
- File Size:
- 45kb
- Update:
- 2014-03-07
- Downloads:
- 0 Times
- Uploaded by:
- 路东方
Description: Depth-first and breadth-first traversal
Adjacency matrix or adjacency list use as a storage structure to build an undirected graph, each vertex is stored in a fruit name (such as apple, orange, banana, etc., and require input from the keyboard), no less than five vertices. Were asked to depth-first search (DFS) and breadth-first search (BFS) traversal, output through the results.
To Search:
File list (Check if you may need any files):
天津理工大学数据结构实验报告4.doc
Download