搜索资源列表
minimumspanningtree
- 给出一个连通带权的无向图,找出该图的最小生成树。并带有问题的详细描述及测试数据。-Given a connected weighted undirected graph, find the minimum spanning tree graph. With a detailed descr iption of the problem and the test data.
Kruskal
- 按克鲁斯卡尔(Kruskal)算法思想,编制一个寻找最小生成树的完整的程序。
shushu
- 最小生成树的具体程序,有关各类文件,直接点击dsw文件就可以运行-Minimum spanning tree of the specific procedures, the different types of documents directly click dsw file to run
zuixiaoshengchengshu
- 分别利用prim算法和kruskal算法实现求图的最小生成树,感觉学习最小生成树的时候有挺多问题,这里是一个用PRIM和KRUSKAL算法做的一个最小生成树算法-, Respectively, using prim algorithm and Kruskal Algorithm for Minimum Spanning Tree, Minimum Spanning Tree feels when learning挺多have probl
6
- 1)掌握普里姆构造最小生成树算法的数据结构和算法实现; 2)掌握图或网的邻接矩阵表示及其上基本算法的实现; 3)按照实验题目要求独立完成实验内容(提交程序清单及相关实验数据与运行结果); 4)认真书写实验报告,并按时提交。 -1) grasp the prim construct minimum spanning tree algorithm for data structure and algorithm 2) ma
diliuci
- 1)掌握普里姆构造最小生成树算法的数据结构和算法实现; 2)掌握图或网的邻接矩阵表示及其上基本算法的实现; -1) grasp the prim construct minimum spanning tree algorithm for data structure and algorithm 2) master plan or a network and its adjacency matrix express the re
Prim
- 最小生成树是数据结构中图的一种重要应用,它的要求是从一个带权无向完全图中选择n-1条边并使这个图仍然连通...为了得到最小生成树,人们设计了很多算法,最著名的有prim算法和kruskal算法。-Minimum spanning tree data structure is an important application of graph, and its request is from a weighted undirected c
prim
- 1.显示该图的邻接矩阵 2.输出最小生成树的所有边及权值和-1. Revealed that the graph adjacency matrix 2. Output minimum spanning tree of all the edge and the right values and
ret
- 实现最小生成树问题,在N个城市之间寻找最短路径-The achievement of minimum spanning tree problem, in the N cities to find the shortest path between
KRUSKAL
- 最小生成树-KRUSKAL算法,做了很长时间才做好的-Minimum Spanning Tree-KRUSKAL algorithm, so a long time to do a good job of
minThree
- 数据结构的课程设计 图的最小生成树,自己做的-Data structure of the curriculum design of minimum spanning tree, do their own
shorPath
- 最小生成树,详细实验报告。希望能给大家带来点帮助-err
PRIM
- PRIM求最小生成树,JAVA源程序,简洁易懂,很不错的。l-PRIM for minimum spanning tree, JAVA source, concise and understandable, it is good. l
thelittesttree
- 数据结构题集C语言版中最小生成树问题源程序,编译成功了的-Data Structure C language version of title set minimum spanning tree problem in the source code, the compiler of success
555
- 最小生成树 用克鲁斯卡尔算法求网的最小生成树-Minimum spanning tree algorithm used for network Kruskal minimum spanning tree
datastruction
- 数据结构课程设计所含题目: 1运动会分数统计**, 2一元多项式计算**, 3订票系统 4猴子选大王 5最小生成树问题** 6 建立一个二叉排序树 -Curriculum design data structure contained in the title: 1 Games Score Statistics**, 2-polynomial calculation**, 3 booking system 4
mintree
- 克鲁斯卡尔算法 以文本形式输出最小生成树中的各条边及它们的权值-Kruskal algorithm to the text of the form of the output of the minimum spanning tree edges and their weights
TheSmallestTree
- 数据结构完整的课程设计:求最小生成树问题,完整的一份.-err
tuxingshiyan
- 1)掌握图的邻接矩阵存储结构表示和与图创建算法的c语言实现; 2)掌握普里姆(Prim)最小生成树算法(P174:算法7.9)的C语言实现及应用; 3)验证如下图5-1所示无向网的最小生成树的正确性 4)按照实验题目要求独立正确地完成实验内容(提交程序清单及相关实验数据与运行结果); -1) The master plan of the adjacency matrix and the storage stru
shu
- 作为小镇网络建设,每个点有权值 实现最小生成树的算法 -As a small town network construction, the value of each point of the realization of the right to minimum spanning tree algorithm