文件名称:tu3
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:1.63kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
1 创建给定图的存储结构,从邻接表和邻接矩阵两种存储方式中选择一种。
2 对所创建的图进行深度和广度优先搜索遍历,给出遍历过程中的顶点序列。
3 求图的最小生成树,按构造顺序输出边的序列。(两种方法都要求!)
3 编写一个主函数,将上面函数连在一起,构成一个完整程序。
4 将实验源程序调试并运行。
-Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!) 3 to prepare a main function, the above function together to form a complete program. 4 source debugging and running the experiment.
2 对所创建的图进行深度和广度优先搜索遍历,给出遍历过程中的顶点序列。
3 求图的最小生成树,按构造顺序输出边的序列。(两种方法都要求!)
3 编写一个主函数,将上面函数连在一起,构成一个完整程序。
4 将实验源程序调试并运行。
-Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!) 3 to prepare a main function, the above function together to form a complete program. 4 source debugging and running the experiment.
相关搜索: tu3
(系统自动生成,下载前可以参看下载内容)
下载文件列表
tu3.cpp
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.