当前位置：
首页 资源下载
搜索资源 - minimum spanning tree
搜索资源列表
-
0下载：
绘制表格
Kruskal算法求得的最小生成树-Drawing forms obtained Kruskal minimum spanning tree algorithm
-
-
0下载：
用普里姆(Prim)算法构造最小生成树,满分作业，运行无错的-With prim (Prim) Minimum Spanning Tree Algorithm, out of operation, run no wrong
-
-
0下载：
这是一个构造最小生成树的Prim算法，是属于贪心算法的范畴。设G=(V,E)是连同带权图，V={1，2，3，...，n}。构造G的最小生成树。-This is a structure of Prim minimum spanning tree algorithm is a greedy algorithm category. Set G = (V, E) is, together with the weighted graph, V = (1,2,3 ,..., n). G of the min
-
-
0下载：
对一个带权无向图，求其最小生成树，本程序功能通过KrusKal算法实现。-Of a weighted undirected graph, and its minimum spanning tree, the program features through the Kruskal algorithm.
-
-
0下载：
最小生成树，不只到谁能将他转换成MATLAB语言的算法？-Minimum spanning tree, not only to him who can convert MATLAB algorithms language?
-
-
0下载：
最小生成树的kruskal算法实现
使用mfc显示界面（可以随机生成边）-Kruskal minimum spanning tree algorithm using mfc display interface (can be randomly generated edge)
-
-
1下载：
题目1：图的建立与遍历；连通网的最小生成树生成实现。
内容：
1） 用邻接表表示方法建立图1所示图的存储结构，用邻接矩阵存表示方法建立图2所示网的存储结构。
2） 在图1 存储结构（邻接表）上实现深度优先搜索遍历和广度优先搜索遍历，并给出遍历结果（序列）。
3） 按照普里姆算法，在图2所示连通网的存储结构（邻接矩阵）上实现此网的最小生成树，并输出生成树。
-Title 1: Map of the establishment and ergodicity conne
-
-
0下载：
最小生成树问题贪心(Prim)算法，该程序原自王晓东算法设计，程序已调通-Greedy minimum spanning tree problem (Prim) algorithm, the program Xiaodong algorithm since the original design, procedures have been transferred Qualcomm
-
-
0下载：
Kruscal算法实现产生最小生成树，适用学习二叉树的朋友-Kruscal have a minimum spanning tree algorithm, the application of learning tree friends
-
-
0下载：
贪心法的算法，里面有最小生成树算法和单点源最短路径的算法，供大家学习参考-Greedy algorithms, there are minimum spanning tree algorithm and single-point-source shortest path algorithm, for them to learn from reference
-
-
0下载：
基于模糊费用最小生成树的算法 的源代码
prim算法 模糊数综合排序-Costs based on fuzzy algorithm for minimum spanning tree algorithm source code prim integrated sort fuzzy numbers
-
-
0下载：
数据结构最小生成树源代码。希望对大家有用。谢谢！-Minimum spanning tree data structure source code. Hope useful for all of us. Thanks!
-
-
0下载：
给定一个地区的n个城市间的距离网，用Prim算法或Kruskal算法建立最小生成树，并计算得到的最小生成树的代价。-Given a region n the distance between cities network, using Prim algorithm or Kruskal minimum spanning tree algorithm, and calculate the cost of the minimum spanning tree.
-
-
0下载：
最小生成树：一个单位内的10个办公点通过局域网连接，输入办公室内的连接线，输出成本最低的局域网连接-Minimum spanning tree: a flat 10 points through the office LAN connectivity, enter the office of the connecting line, the output of the lowest cost LAN connectivity
-
-
0下载：
Kruskal求最小生成树算法 . 详细中文注释, 易于理解!-Kruskal for minimum spanning tree algorithm. Detailed English notes, easy to understand!
-
-
0下载：
PRIM算法 对任意给定的网和起点，用PRIM算法的基本思想求解出所有的最小生成树。-PRIM algorithm for any given network and the starting point, PRIM algorithm used to solve the basic idea of all the minimum spanning tree.
-
-
0下载：
图的最小生成树
-Minimum Spanning Tree
-
-
0下载：
图求最小生成树的程序
功能良好
性能较好-Figure for minimum spanning tree of the program features the good performance of better
-
-
0下载：
这是解决图论中最小树问题的求解程序，是一种很好的解决方法-This is to solve minimum spanning tree in graph theory problem solving process, is a good solution
-
-
0下载：
子集和数问题 实现对图的最小生成树实现，通过此算法可以找到此图中连接所有点的最小生成树-Subset of several questions on the implementation of the minimum spanning tree implementation plans, the passage of this algorithm can find this chart connecting all points of the minimum spanning tree
-
«
1
2
...
8
9
10
11
12
1314
15
16
17
18
...
44
»
