搜索资源列表
-
0下载:
在权值不同的图中寻找一个最小生成树的问题-different weights in the map to find a minimum spanning tree problem
-
-
0下载:
kruskal算法来得到最小生成树的程序-Kruskal algorithm to be the minimum spanning tree procedures
-
-
1下载:
这是一个用prim算法来得到最小生成树的程序-This is a prim algorithm used to be the minimum spanning tree procedures
-
-
1下载:
最小生成树的算法,用VC++6.0编写,在控制台上实现-minimum spanning tree algorithm, VC 6.0 preparation, the console to achieve
-
-
0下载:
kruscal算法求最小生成树算法
欢迎大家使用-kruscal algorithm for the minimum spanning tree algorithm Everyone is welcome to use
-
-
0下载:
求最大生成树,实际上是以最小生成树的算法为基础进行改进,我采用的是kruskal算法,基本思路是对各个边的权进行排序,然后加入生成树,形成环的点跳过,直到生成最大生成树。JAVA的特点是输入输出比较便利,所以问题的关键在于用监控将图的初始化和树的生成衔接。-Spanning Tree for the largest, is actually the minimum spanning tree algorithm-based improvement, I used the Kruskal algo
-
-
0下载:
最小生成树:利用普鲁姆算法,完成将给定节点和边的权值的图生成最小生成树,用于各项公共事业最少经费的设计方法-minimum spanning tree : pass algorithm, Givens completed nodes and the right side of the value of the minimum spanning tree generation for public utilities at least for the design method
-
-
0下载:
这是一个求最短路和最小生成树的C++的原代码,经过调试可以在机子上使用.-This is the most short-circuit for a minimum spanning tree and the original C code, after testing the use of loom.
-
-
0下载:
生成最小生成树的源代码,对数据结构中图论处理有帮助,有兴趣可以下-minimum spanning tree generation of source code, the data structure graph theory to help deal with are interested can make
-
-
0下载:
概要設計
1、程序運\行流程:
(1)、提示輸入頂點數目;
(2)、接受輸入,按照項目要求產生邊權值的隨機矩陣;然後求解最小生成樹;
(3)、輸出最小生成樹並且退出-an outline design, the procedures in process : (1), suggesting that the number of input vertices; (2), accept input, In accordance with requirements of the pro
-
-
0下载:
网的最小生成树问题-net minimum spanning tree problem
-
-
0下载:
用matlab去实现基于dijkstra算法实现最小生成树-Using matlab to dijkstra algorithm based on minimum spanning tree
-
-
0下载:
贪心法是解决某些优化问题的一种策略。假设我们可以通过一系列的决策来解决某个问题。贪心法使用如下的方法:在每个阶段做出的决策都是局部最优的决策。对于某些问题,这些局部最优解最终成为全局最优解。-Generation of minimum spanning tree algorithm Kruskal
-
-
0下载:
一种C++环境下简单的西安地铁规划最小生成树(站点选自西安地铁234号线路)-Simple in of a C++ environment Xi' an Metro Planning minimum spanning tree (site selected from the Xi' an Subway 234 lines)
-
-
0下载:
在数据机构中,在图论中,搜索整个图,生成最小生成树。-Data organization, in graph theory, search the entire diagram, generate a minimum spanning tree.
-
-
0下载:
最小生成树 用c++实现的,用的是kruskal算法实现的-Minimum spanning tree
-
-
0下载:
在n个城市间建立通信网络,需架设n-1条线路。求解如何以最低经济代价建设此通信网,这是一个最小生成树问题。要求:(1)利用普利姆算法求网的最小生成树;(2)输出生成树中各边及权值。-The n cities to establish communication between networks, the need to set up n-1 lines. How to solve this at the lowest economic cost of building communication
-
-
0下载:
最小生成树权值计算的源代码,输入结点个数,和各结点之间用三元法表示的权值,利用算法计算最小生成树-Minimum spanning tree weight calculation of the source code, the right to use the ternary notation of the number of input values between nodes, and each node using the minimum spanning tr
-
-
0下载:
最小生成树遍历反面的matlab代码,可以参考的,如果需要的话,可以下载啦-Minimum spanning tree traversal negative matlab code, you can refer to, if necessary, you can download it
-
-
0下载:
Minimum Spanning Tree BY ICA
-