文件名称:tu
介绍说明－－下载内容均来自于网络，请自行研究使用
（1）键盘输入数据，建立一个有向图的邻接表。
（2）输出该邻接表。
（3）建立一个无向图的十字链表。
（4）在有向图的邻接表的基础上计算各顶点的度，并输出。
（5）采用邻接表存储实现无向图的深度优先遍历。。
（6）采用邻接表存储实现无向图的广度优先遍历。
（7）以有向图的邻接表为基础实现并输出它的拓扑排序序列
（8）采用邻接矩阵存储实现无向图的最小生成树的PRIM算法。
（9）在主函数中设计一个简单的菜单，分别调试上述算法。-(1) keyboard input data, the establishment of a directed graph adjacency list. (2) the output of the adjacent table. (3) the establishment of an undirected graph Cross Chain. (4) to the adjacent table based on the calculation of each vertex of the degree, and outputs. (5) The adjacent table stores the depth-first traversal of undirected graph. . (6) adjacent table storage undirected graph breadth-first traversal. (7) to the adjacent table based to achieve adjacency matrix storage and output topological sorting sequence (8) PRIM algorithm undirected minimum spanning tree. (9) to design a simple menu in the main function, respectively commissioning of the above algorithm.
（2）输出该邻接表。
（3）建立一个无向图的十字链表。
（4）在有向图的邻接表的基础上计算各顶点的度，并输出。
（5）采用邻接表存储实现无向图的深度优先遍历。。
（6）采用邻接表存储实现无向图的广度优先遍历。
（7）以有向图的邻接表为基础实现并输出它的拓扑排序序列
（8）采用邻接矩阵存储实现无向图的最小生成树的PRIM算法。
（9）在主函数中设计一个简单的菜单，分别调试上述算法。-(1) keyboard input data, the establishment of a directed graph adjacency list. (2) the output of the adjacent table. (3) the establishment of an undirected graph Cross Chain. (4) to the adjacent table based on the calculation of each vertex of the degree, and outputs. (5) The adjacent table stores the depth-first traversal of undirected graph. . (6) adjacent table storage undirected graph breadth-first traversal. (7) to the adjacent table based to achieve adjacency matrix storage and output topological sorting sequence (8) PRIM algorithm undirected minimum spanning tree. (9) to design a simple menu in the main function, respectively commissioning of the above algorithm.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
tu.doc