Search - kruskal minimum tree

Search - kruskal minimum tree - List

[Other] Kruskal.cpp DL : 0: 在权值不同的图中寻找一个最小生成树的问题-different weights in the map to find a minimum spanning tree problem
Date : 2025-12-26 Size : 3kb User : 刘通学
[Other] Kruskal算法 DL : 0: kruskal算法来得到最小生成树的程序-Kruskal algorithm to be the minimum spanning tree procedures
Date : 2025-12-26 Size : 1kb User : yue
[Other] 7_7Kruskal DL : 0: 最小生成树的经典算法——Kruskal算法。用C++实现-minimum spanning tree algorithm classic-- Kruskal algorithm. C to achieve
Date : 2025-12-26 Size : 129kb User : 周娜娜
[Other] MaxSpanningTree DL : 0: 求最大生成树，实际上是以最小生成树的算法为基础进行改进，我采用的是kruskal算法，基本思路是对各个边的权进行排序，然后加入生成树，形成环的点跳过，直到生成最大生成树。JAVA的特点是输入输出比较便利，所以问题的关键在于用监控将图的初始化和树的生成衔接。-Spanning Tree for the largest, is actually the minimum spanning tree algorithm-based improvement, I used the Kruskal algorithm, the basic idea is to the right of each side in order, then joined the spanning tree, formed in Central Point skip until Spanning Tree greatest generation. Java is characterized easier to input and output, Therefore, the key is to use the plan to monitor the initialization and tree generation convergence.
Date : 2025-12-26 Size : 2kb User : 笑笑
[Other] kruskal DL : 0: 最小生成树的代码实现。运用kruskal算法实现。-Minimum spanning tree of the code. The use of Kruskal algorithm.
Date : 2025-12-26 Size : 712kb User : ahkoo
[Other] mst DL : 0: 最小生成树 MST的四种算法实现。包括普通的Kruskal算法和Prim算法，用Disjoint-Set优化的Kruskal算法和用Heap优化的堆算法。复杂度分别为O(mn), O(n^2), O(m log n), O(m log n)-Minimum Spanning Tree Algorithm
Date : 2025-12-26 Size : 3.74mb User : 黄劲松
[Other] PRIM DL : 0: 构造最小生成树的常用方法是Prim算法与Kruskal算法，二者都是基于贪心算法设计侧略。-Construction of the commonly used minimum spanning tree algorithm is Prim and Kruskal algorithms, both are based on the design side of a little greedy algorithm.
Date : 2025-12-26 Size : 1kb User : workfuture
[Other] Discreteoptimization DL : 0: 它包含了枚举法、蒙特卡洛法、线性整数规划、整数规划枚举法、整数规划隐枚举法、非线性整数规划、非线性整数规划图形工具、最小生成树kruskal算法、最短路dijkstra算法、最小生成树kruskal算法mex程序、最短路dijkstra算法mex程序和动态规划的代码。-It contains the matlab code of the enumeration method, Monte Carlo method, linear integer programming, integer programming, enumeration, integer programming, implicit enumeration method, non-linear integer programming, non-linear integer programming, graphical tools, kruskal minimum spanning tree algorithm, dijkstra shortest path algorithm, minimum spanning tree kruskal algorithm mex procedure dijkstra shortest path algorithm and dynamic programming mex program.
Date : 2025-12-26 Size : 32kb User : 温娟
[Other] Kruskalsuanfa DL : 0: 用Kruskal算法得到最小生成树，用c语言实现的，希望有用-Kruskal minimum spanning tree algorithm be used, with c language, and I hope helpful
Date : 2025-12-26 Size : 12kb User : king
[Other] Kruskal DL : 0: 自己实现的最小生成树算法，c++版本的，字数要长，-Minimum Spanning Tree Algorithm
Date : 2025-12-26 Size : 1.03mb User : aby
[Other] Kruskal DL : 0: 离散数学图论实验：用Kruskal算法求给定图的最小树-Discrete Mathematics Graph Theory experiment: Kruskal algorithm for minimum spanning tree given graph
Date : 2025-12-26 Size : 9kb User : 梁涛
[Other] Kruskal DL : 0: kruskal算法，可以用来解决最小生成树的问题，本算法已经改进，可以直接输入邻接矩阵计算便可-kruskal algorithm can be used to solve the minimum spanning tree problem, the algorithm has been improved, you can directly enter the adjacency matrix can be calculated
Date : 2025-12-26 Size : 1kb User : 周瑜
[Other] Kruskal DL : 0: Kruskal算法，解决最小生成树问题，同样也是图论中很重要的一个算法-Kruskal algorithm to solve the minimum spanning tree problem in graph theory is also very important to an algorithm
Date : 2025-12-26 Size : 480kb User : 晓晓
[Other] Kruskal-algorithm DL : 0: 使用克鲁斯卡尔算法生成最小生成树，将输入的边按照权值大小进行排列，每条边的端点属于不同的集合，当选取的一条边的两个端点同属于一个集合时，此边放弃。不属于同一个集合则合并。 -Use kruskal algorithm to generate the minimum spanning tree, the edge of the input according to the weight, size of each edge endpoints belong to different collections, elected to take an edge of two endpoints with belongs to a collection, this side to give up. Do not belong to the same collection is merged.
Date : 2025-12-26 Size : 1kb User : 万琪
[Other] Kruskal DL : 0: Kruskal 算法是一种按照图中边的权值递增的顺序构造最小生成树的方法。其基本思想是：设无向连通网为G＝（V，E），令G 的最小生成树为T，其初态为T＝（V，{}），即开始时，最小生成树T 由图G 中的n 个顶点构成，顶点之间没有一条边，这样T 中各顶点各自构成一个连通分量。然后，按照边的权值由小到大的顺序，考察G 的边集E 中的各条边。若被考察的边的两个顶点属于T 的两个不同的连通分量，则将此边作为最小生成树的边加入到T 中，同时把两个连通分量连接为一个连通分量；若被考察边的两个顶点属于同一个连通分量，则舍去此边，以免造成回路，如此下去，当T 中的连通分量个数为1 时，此连通分量便为G 的一棵最小生成树。-Kruskal algorithm is a value in accordance with the right side of the graph in order of increasing minimum spanning tree approach. The basic idea is: Let undirected network connectivity for G = (V, E), so that the minimum spanning tree of G is T, its initial state is T = (V, {}), when that started, the minimum spanning tree T by The graph G of n vertices, there is an edge between vertices, and the vertices of each of the T constituting a connected component. Then, follow the right side of the value of the order from small to big, examining G' s edge set E of the respective sides. Two vertices belonging to the edge if they are examined two different T connected component, then this edge as the minimum spanning tree edge added to T while the two connected components connected to a connected component side if they are investigated two vertices belong to the same connected component, then rounding the edges to avoid loops, and so on, when the number of connected components T 1, this co
Date : 2025-12-26 Size : 13kb User : 崔哲
[Other] kruskal-Minimum-Spanning-Tree DL : 0: 普里母和kruskal 生成最小生成树普里母和kruskal 生成最小生成树 -Minimum Spanning Tree
Date : 2025-12-26 Size : 250kb User : xiangyu
[Other] Discrete-Optimization DL : 0: 离散优化 *enum - 枚举法 *monte - 蒙特卡洛法 *lpint (BranchBound)- 线性整数规划 *L01p_e - 0-1整数规划枚举法 *L01p_ie - 0-1整数规划隐枚举法 *bnb18 - 非线性整数规划(在MATLAB5.3使用) *bnbgui - 非线性整数规划图形工具(在MATLAB5.3使用) *mintreek - 最小生成树kruskal算法 *minroute - 最短路dijkstra算法 *krusk - 最小生成树kruskal算法mex程序 *dijkstra - 最短路dijkstra算法mex程序 *dynprog - 动态规划- Discrete optimization * enum- enumeration method * monte- Monte Carlo method * lpint (BranchBound)- integer linear programming * L01p_e- 0-1 integer programming enumeration method * L01p_ie- 0-1 integer programming hidden enumeration method * bnb18- Nonlinear Integer Programming (used in MATLAB5.3) * bnbgui- nonlinear integer programming graphical tool (used in MATLAB5.3) * mintreek- kruskal minimum spanning tree algorithm * minroute- Shortest dijkstra algorithm * krusk- kruskal minimum spanning tree algorithm mex program * dijkstra- the shortest path algorithm mex program dijkstra * dynprog- Dynamic Programming
Date : 2025-12-26 Size : 32kb User : lxc
[Other] kruskal DL : 0: 无向图最小生成树,kruskal算法,邻接表形式,复杂度O(mlogm)-Undirected graph minimum spanning tree, kruskal algorithm, adjacency table form, complexity O (mlogm)
Date : 2025-12-26 Size : 1kb User : 曹城生
[Other] 10164 DL : 0: Kruskal最小生成树算法一、实验目的 1、掌握图的邻接表结构 2、掌握最小生成树算法二、实验内容基于邻接表实现kruskal算法(Kruskal minimum spanning tree algorithm, the purpose of the experiment 1. Master the adjacency list structure of the graph 2, master the minimum spanning tree algorithm Two, experimental content Implementation of Kruskal algorithm based on adjacency list)
Date : 2025-12-26 Size : 58kb User : 结节
[Other] 最小生成树之kruskal算法 DL : 0: 最小生成树之kruskal算法的概念及其实现 kruskal算法的精髓在于：每次选取一条边。该边同时满足：1、在当前未选边中权值最小；2、与已选边不构成回路。直到选取n-1条表是算法结束。找到MST活判断不存在MST。(The concept and implementation of Kruskal algorithm for minimum spanning tree The essence of Kruskal algorithm lies in: Select one edge at a time. At the same time, it satisfies: 1, the minimum weight in the current unselected edge; 2, and the selected side does not constitute the loop. Until the N-1 table is selected, the algorithm is finished. Find MST alive and judge that there is no MST.)
Date : 2025-12-26 Size : 11kb User : cuihuiling

« 12 »