文件名称:wuxiangtu
介绍说明－－下载内容均来自于网络，请自行研究使用
（1）建立一个无向图的邻接表，并输出该邻接表。
（2）采用邻接表存储实现无向图的深度优先遍历。。
（3）采用邻接表存储实现无向图的广度优先遍历。
（4）在主函数中设计一个简单的菜单，分别调试上述算法。
-(1) the establishment of an undirected graph adjacency list and outputs the adjacent table.
(2) using the adjacent table storage realize undirected graph depth-first traversal. .
(3) using the adjacent table storage realize undirected graph breadth-first traversal.
(4) design a simple menu in the main function, namely debug the algorithm described above.
（2）采用邻接表存储实现无向图的深度优先遍历。。
（3）采用邻接表存储实现无向图的广度优先遍历。
（4）在主函数中设计一个简单的菜单，分别调试上述算法。
-(1) the establishment of an undirected graph adjacency list and outputs the adjacent table.
(2) using the adjacent table storage realize undirected graph depth-first traversal. .
(3) using the adjacent table storage realize undirected graph breadth-first traversal.
(4) design a simple menu in the main function, namely debug the algorithm described above.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
无向图.cpp