Location:
Search - kruskal
Search list
Description: prim算法
kruskal算法用matlab实现
输入标准：x邻接矩阵 p节点集
输出：生成树边集 G-prim algorithm Kruskal algorithm matlab input standard: x adjacency matrix p Node Set Output: Spanning Tree margination G
Platform: |
Size: 1024 |
Author: yumeng |
Hits:
Description: 程序给出邻接表中的边结点的类型、邻接矩阵类的定义。利用KRUSKAL方法求边集数组的GE的最小生成树，树中每条边一次存于数组C中并给出了邻接矩阵类的实现，最后对邻接矩阵类主要操作进行测试，并输出运行结果。-Procedures are given in the table edge adjacent node types, the definition of adjacency matrix category. Method use KRUSKAL margination array of GE s minimum spanning tree, each side of a tree stored in an array in C and category adjacency matrix is given the realization of the final major of the adjacency matrix to test the operation and output results.
Platform: |
Size: 3072 |
Author: cool |
Hits:
Description: 利用克鲁斯卡尔算法求最小生成树，并画出图形-The use of Kruskal algorithm for minimum spanning tree, and draw graphics
Platform: |
Size: 5120 |
Author: 刘婷玥 |
Hits:
Description:
Platform: |
Size: 1024 |
Author: zhaoyanjie |
Hits:
Description: 用Kruskal算法构造最小生成树解决指派问题（assignment problem）
一家公司经理准备安排 名员工去完成 项任务，每人一项。由于各员工的特点不同，不同的员工去完成同一项任务时所获得的回报是不同的。如何分配工作方案可以使总回报最大？
-Kruskal Algorithm used to solve assignment problem minimum spanning tree (assignment problem), a manager of the company prepare arrangements for employees to complete tasks, each one. As a result of the characteristics of different staff, different staff to accomplish the same mission when the return is different. How to allocate the work program can make the greatest total return?
Platform: |
Size: 230400 |
Author: liuzhi |
Hits:
Description: MATHEMATICA 软件运用
最小生成树的Kruskal算法-MATHEMATICA software application of the Kruskal minimum spanning tree algorithm
Platform: |
Size: 1024 |
Author: yangmingze |
Hits:
Description: 这个是严蔚敏版的数据结构上机教程中的部分源代码，都是自己写的，包括最短路径的dijkstra,floyd，最小生成树的prim,kruskal以及链表，Huffman Tree等等的c++代码-This is Yan Wei-min version of the data structure on the machine part of the tutorial source code, are written in their own, including the shortest path dijkstra, floyd, minimum spanning tree of the prim, kruskal as well as the list, Huffman Tree, etc. c++ code
Platform: |
Size: 12288 |
Author: wang yucao |
Hits:
Description: 根据kruskal算法写成的求一棵树的最小生成树的程序。-According to Kruskal algorithm written in a tree for the minimum spanning tree procedure.
Platform: |
Size: 1024 |
Author: hezj |
Hits:
Description: 学数据结构的同学可以看看，这是最小生成树的另一种方法-Data structure of the students can see that this is the minimum spanning tree Another method
Platform: |
Size: 1024 |
Author: 杨倩倩 |
Hits:
Description: 绘制表格
Kruskal算法求得的最小生成树-Drawing forms obtained Kruskal minimum spanning tree algorithm
Platform: |
Size: 2048 |
Author: 李方 |
Hits:
Description: 最小生成树的kruskal算法实现
使用mfc显示界面（可以随机生成边）-Kruskal minimum spanning tree algorithm using mfc display interface (can be randomly generated edge)
Platform: |
Size: 41984 |
Author: 纪旭 |
Hits:
Description: 算法设计的实验报告
包括Bottom-Up Merge Sorting算法、插入排序算法Heaps的创建堆、堆排序算法、按秩合并算法以及带路径压缩算法、实现查找第K小元素算法、实现快速排序算法、实现平面内最接近点对算法、实现最长公共子序列算法、实现矩阵链相乘算法、实现0/1背包问题算法、实现Dijistra’s算法、Prim算法、Kruskal算法、文件压缩算法-Experimental Algorithm Design Report including Bottom-Up Merge Sorting Algorithm, Insertion Sort algorithm creation Heaps Heap, Heap Sort algorithm, according to rank and merge algorithm with path compression algorithm to find the first small element K algorithm, the realization of quick sort algorithm, the realization of planar within the nearest point on the algorithm to achieve the longest common sub-sequence algorithm, the realization of matrix-chain multiplication algorithm, the realization of 0/1 knapsack problem algorithm Dijistra s algorithm, Prim algorithm, Kruskal algorithm, file compression algorithm
Platform: |
Size: 28672 |
Author: 苏宁 |
Hits:
Description: 图的基类以及最短路径算法，dijkstra,floyd，Kruskal算法等，代码来自北大赵海燕老师编著的数据结构与算法。-Graph base class as well as the shortest path algorithm, dijkstra, floyd, Kruskal algorithm, code Zhao Haiyan teachers from Beijing University and edited by the data structure and algorithm.
Platform: |
Size: 663552 |
Author: 张淼 |
Hits:
Description: 最小生成树：一个单位内的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
Platform: |
Size: 131072 |
Author: lee |
Hits:
Description: 废话少说，下面是大家都熟悉的kruskal算法，重点在于实现，时间复杂度为O(e*loge)，其中e为边数。
Platform: |
Size: 11264 |
Author: kark |
Hits:
Description: 本算法是一个关于kruskal的源码实现,可供大家学习研究.-This algorithm is a source about the implementation kruskal for U.S. study.
Platform: |
Size: 343040 |
Author: xj |
Hits:
Description: Implements Minimum Search Tree using Kruskal Algorithm
Platform: |
Size: 2048 |
Author: aleofriend |
Hits:
Description: minimum spanning tree using kruskal algorithm
Platform: |
Size: 7168 |
Author: nikhil |
Hits:
Description: kruskal( 利用堆，并查集（即树的等价问题）实现) -kruskal (the use of heap, and check collection (that is, the issue of tree-equivalent) to achieve)
Platform: |
Size: 1024 |
Author: luo |
Hits:
Description: Kruskal算法的编程实现，可以构造出一颗最生成小树-Programming Kruskal algorithm, can be constructed out of a small tree to generate the most
Platform: |
Size: 9216 |
Author: Alice |
Hits:
«
1
2
3
4
5
67
8
9
10
11
...
28
»