搜索资源列表
csharpMinSpanTree
- .net最小生成树的普林算法和克鲁斯卡尔算法得算法过程-. Net Princeton minimum spanning tree algorithm and Kruskal algorithms have algorithm process
MINTREEK
- Kruskal生成最小树算法，可以画出最小树-Kruskal generate a minimum spanning tree algorithm, can draw a minimum spanning tree
kruakal
- 用并查集和最小堆算法实现KRUSKAL算法-Use and check the set and minimum heap algorithm achieve KRUSKAL algorithms
PHEAP
- 联通图G的一个子图如果是一棵包含G的所有顶点的树，则该子图称为G的生成树 生成树是联通图的极小连通子图。所谓极小是指：若在树中任意增加一条边，则 将出现一个回路；若去掉一条边，将会使之编程非连通图。生成树各边的权 值总和称为生成素的权。权最小的生成树称为最小生成树，常用的算法有prime算法和kruskal算法。 -Unicom graph G is a subgraph of G is the one that contains all the vertices of the tree,
Minimum-spanning-tree
- 给定一个地区的n个城市间的距离网，用Prim算法或Kruskal算法建立最小生成树，并计算得到的最小生成树的代价-The distance between the network to set a region of n cities, Prim' s algorithm or Kruskal' s algorithm to create a minimum spanning tree, and the calculation of the cost of the minimum s
GreedyAlgorithm
- Prim,Kruskal,Dijkstra 三个算法的java统一界面实现，可以用同一个界面以及公用一些类与变量，最后还有哈弗曼算法实现，可以作为学习算法的好例子-Prim, Kruskal, Dijkstra algorithm java three unified interface to achieve, you can use the same interface as well as public classes and variables, and finally Huffman a
GRAPH
- 实现无向图及其基本操作； 利用Prim算法实现图的最小生成树； 利用Kruskal算法实现图的最小生成树。 -Achieve an undirected graph and its basic operations utilize Prim minimum spanning tree algorithm graph use Kruskal minimum spanning tree algorithm graph.
zuixiaoshengchengshusuanfa
- 通过数组的方式创建网，然后分别用克鲁斯卡尔和普里姆算法求得最小生成树-Create network by means of an array, and then separately in kruskal minimum spanning tree algorithm and she obtained
MATLAB__Dijkstra
- 常用的几个MATLAB算法源码，有Dijkstra、Floyd、Prim、Kruskal等。源码绝对可用。嘿嘿！-Several commonly used MATLAB algorithm source code, there Dijkstra, Floyd, Prim, Kruskal and so on. Source absolutely available. Hey!
graph_algorithm_matlab_program
- 各种图论算法的matlab程序实现，包括floyd、hamilton、kruskal等-Various graph algorithm matlab program implementation, including floyd, hamilton, kruskal etc.
power-system
- c++实现电网建设造价模拟系统,使用了kruskal和prim两种算法，学习数据结构图的好练习-using kruskal and prim algorithm to develop a system to simulate power network
Kuruskal_Minispining_tree
- 最小生成树Kruskal算法的实现，采用openGL显示界面，支持顶点数量设置，以及位置移动，边的权值可自行设置，界面右侧分两个版图，上方是原图，下方为算法运行过程图-Implement Kruskal minimum spanning tree algorithm, using openGL display interface, support for setting the number of vertices, and the location of the mobile, edge we
minimum-spanning-tree
- 用c语言编写的最小生成树算法kruskal和prim-Using c language Minimum Spanning Tree Algorithm prim and kruskal