Search - kruskal minimum tree

Search - kruskal minimum tree - List

[Mathimatics-Numerical algorithms] 最小生成树程序 DL : 0: 最小生成树程序。使用克鲁斯卡尔(Kruskal)算法，使用dephi编写。-minimum spanning tree procedures. Use Kelushikaer (Kruskal) algorithm, dephi prepared.
Date : 2008-10-13 Size : 173.71kb User : 陈琳
[Mathimatics-Numerical algorithms] kruskal DL : 0: kruscal求最小生成树-kruscal for minimum spanning tree
Date : 2008-10-13 Size : 1.4kb User : 尹盛
[Mathimatics-Numerical algorithms] kruskal DL : 1: kruscal求最小生成树-kruscal for minimum spanning tree
Date : 2025-12-26 Size : 1kb User : 尹盛
[Mathimatics-Numerical algorithms] 最小生成树程序 DL : 0: 最小生成树程序。使用克鲁斯卡尔(Kruskal)算法，使用dephi编写。-minimum spanning tree procedures. Use Kelushikaer (Kruskal) algorithm, dephi prepared.
Date : 2025-12-26 Size : 173kb User : 陈琳
[Mathimatics-Numerical algorithms] yuanma DL : 0: 用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?
Date : 2025-12-26 Size : 225kb User : liuzhi
[Mathimatics-Numerical algorithms] Kruskal DL : 1: Kruskal求最小生成树算法 . 详细中文注释, 易于理解!-Kruskal for minimum spanning tree algorithm. Detailed English notes, easy to understand!
Date : 2025-12-26 Size : 2kb User : Jiandong Yang
[Mathimatics-Numerical algorithms] MST_Kruskal DL : 0: Implements Minimum Search Tree using Kruskal Algorithm
Date : 2025-12-26 Size : 2kb User : aleofriend
[Mathimatics-Numerical algorithms] automatic-classification-cluster DL : 0: 一、问题描述若要在n个城市之间建役通信网络，只福要架设n-1条级路即可．如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。二、基本要求（1）利用克鲁斯卡尔算法求图的最小生成树。（2）能实现教科书6.5节中定义的抽象数据类型MFSet.以此表示构造生成树过程中的连通分量。 (3 ) 以文本形式输出生成树中各条边以及他们的权值．三、需求分析 1、构造图结构。 2、利用克鲁斯卡尔算法求图的最小生成树。 3、完成生成树的输出。 -I. Description of the problem to the n cities built between the service communication networks, Fuk only n-1 to set up the way to class Article. How to minimize the economic cost of building the communications network is a network of minimum spanning tree problem. Second, the basic requirements of (1) the use of Kruskal Algorithm for Minimum Spanning Tree. (2) to achieve 6.5 in the textbook definition of abstract data types MFSet. Spanning tree structure as that in the process of component connectivity. (3) to output text in the spanning tree edges and their weights. Third, a needs analysis, structural map structure. 2, the use of Kruskal Algorithm for Minimum Spanning Tree. 3, complete the spanning tree output.
Date : 2025-12-26 Size : 668kb User : 赵婧
[Mathimatics-Numerical algorithms] Graph DL : 0: 图的大部分实现图的深度优先周游图的广度优先周游由队列方式实现的拓扑排序由深度优先搜索方式实现的拓扑排序单源最短路径(Dijkstra算法) 每对顶点之间的最短路径(Floyd算法) 最小支撑树(Prim算法) 最小支撑树(Kruskal算法)-Figure most of the implementation diagram of the depth-first breadth-first tour travel map be achieved by the topological sort the queue depth-first search be achieved by the topological sorting single-source shortest path (Dijkstra algorithm) between each pair of vertices the shortest path (Floyd Algorithm ) minimum spanning tree (Prim algorithm) minimum spanning tree (Kruskal algorithm)
Date : 2025-12-26 Size : 10kb User : fzkj
[Mathimatics-Numerical algorithms] kruskal DL : 0: 图论作业中的Kruskal算法，从图的最小边开始，进行避圈式扩张，使得生成树各边权值之和为最小。-Figure of Job in the Kruskal algorithm, starting from the minimal side, to avoid the ring-type expansion, making the weight of each side of the spanning tree and minimum.
Date : 2025-12-26 Size : 2kb User : cynthia
[Mathimatics-Numerical algorithms] kruskal_matlab DL : 0: 使用matlab实现Kruskal算法，用于产生最小生成树，包括测试结果-use matlab to realize Kruskal algorithm， Minimum Spanning Tree,including test result
Date : 2025-12-26 Size : 8kb User : fc
[Mathimatics-Numerical algorithms] kruskal-sf-C DL : 0: kruskal算法克鲁斯卡尔算法最小生成树 C语言程序-kruskal algorithm Kruskal minimum spanning tree algorithm C language program
Date : 2025-12-26 Size : 1kb User : 程序员
[Mathimatics-Numerical algorithms] min-tree DL : 0: 最小生成树，就是给定一个无向图，挑选若干条边，连成一个树行图（无圈），使得所选边的权至和最小。运用的是Kruskal算法。-Minimum spanning tree, that is, given an undirected graph, choose several edge, into a tree line graph (no ring), making minimal rights to the selected edge
Date : 2025-12-26 Size : 2kb User : 陆虎
[Mathimatics-Numerical algorithms] Kruskal DL : 0: 这是最小生成树Kruskal算法用C语言实现的程序。-This is the Kruskal minimum spanning tree algorithm using C language program.
Date : 2025-12-26 Size : 11kb User : 周坤
[Mathimatics-Numerical algorithms] Prim+Kruskal 算法求最小生成树 DL : 0: C语言 Prim Kruskal 算法求最小生成树(C language Prim+Kruskal algorithm for minimum spanning tree)
Date : 2025-12-26 Size : 1kb User : anonym0us