Search - kruskal minimum tree

Search - kruskal minimum tree - List

[Data structs] kruskal最小生成树实现 DL : 0: 在boost基础上实现对图的最小生成树实现，通过此算法可以找到此图中连接所有点的最小生成树。-the boost on the basis of the plan to achieve the minimum spanning tree, the algorithm can find this map connect all the points the minimum spanning tree.
Date : 2025-12-26 Size : 2kb User :
[Data structs] mintreek DL : 0: 图论中最小生成树Kruskal算法及画图程序 M-函数格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号附图,红色连线为最小生成树的图例如 n=6 w=inf*ones(6) w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3] w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6 [a,b]=mintreek(n,w) -Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5] w (2, [3,5]) = [5,3] w (3, [4,5,6]) = [5,6,4] w (4,6) = 2 w (5,6) = 6 [a, b] = mintreek (n, w)
Date : 2025-12-26 Size : 1kb User : lluo
[Data structs] KRUSKAL DL : 0: 最小生成树－KRUSKAL算法，做了很长时间才做好的-Minimum Spanning Tree-KRUSKAL algorithm, so a long time to do a good job of
Date : 2025-12-26 Size : 1kb User : zhouwei
[Data structs] Kruskal DL : 0: 按克鲁斯卡尔（Kruskal）算法思想，编制一个寻找最小生成树的完整的程序。-By Kruskal (Kruskal) algorithm ideas, the preparation of a minimum spanning tree search procedures.
Date : 2025-12-26 Size : 1kb User : liangliu
[Data structs] kruskal DL : 0: 本程序为使用克鲁斯卡尔 (kruskal)算法构造最小生成树，首先使用链表建立连通图，交换权值以及头和尾，对权值进行排序，使用克鲁斯卡尔 (kruskal)算法构造最小生成树-This procedure for the use of Kruskal (kruskal) Minimum Spanning Tree Algorithm, the first to use linked lists to establish connectivity map, the right to exchange value, as well as head and tail, sort of weights, the use of Kruskal (kruskal) algorithm for the smallest structure Spanning Tree
Date : 2025-12-26 Size : 1kb User : ruikobe
[Data structs] lelusikaewr DL : 0: 利用克鲁斯卡尔算法求最小生成树，并画出图形-The use of Kruskal algorithm for minimum spanning tree, and draw graphics
Date : 2025-12-26 Size : 5kb User : 刘婷玥
[Data structs] Kruskal DL : 0: MATHEMATICA 软件运用最小生成树的Kruskal算法-MATHEMATICA software application of the Kruskal minimum spanning tree algorithm
Date : 2025-12-26 Size : 1kb User : yangmingze
[Data structs] tree DL : 0: 根据kruskal算法写成的求一棵树的最小生成树的程序。-According to Kruskal algorithm written in a tree for the minimum spanning tree procedure.
Date : 2025-12-26 Size : 1kb User : hezj
[Data structs] 346 DL : 0: 绘制表格 Kruskal算法求得的最小生成树-Drawing forms obtained Kruskal minimum spanning tree algorithm
Date : 2025-12-26 Size : 2kb User : 李方
[Data structs] KrusKal DL : 0: 对一个带权无向图，求其最小生成树，本程序功能通过KrusKal算法实现。-Of a weighted undirected graph, and its minimum spanning tree, the program features through the Kruskal algorithm.
Date : 2025-12-26 Size : 99kb User : 傅山
[Data structs] MSTkruskal DL : 0: 最小生成树的kruskal算法实现使用mfc显示界面（可以随机生成边）-Kruskal minimum spanning tree algorithm using mfc display interface (can be randomly generated edge)
Date : 2025-12-26 Size : 41kb User : 纪旭
[Data structs] kruskal DL : 0: 最小生成树：一个单位内的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
Date : 2025-12-26 Size : 128kb User : lee
[Data structs] tree DL : 0: 克鲁斯卡尔算法构造最小生成树，数据结构，可执行-Construction Kruskal minimum spanning tree algorithm, data structure, the executable
Date : 2025-12-26 Size : 16kb User : cjf
[Data structs] MST_Kruskal DL : 0: 最小生成树 kruskal算法，联通图，最短路径-Kruskal minimum spanning tree algorithm, Unicom map, the shortest path
Date : 2025-12-26 Size : 3kb User : dyh
[Data structs] tree DL : 0: 最小生成树Kruskal避圈算法的实现变M,N-Kruskal minimum spanning tree algorithm to avoid the realization of variable ring M, N
Date : 2025-12-26 Size : 2kb User : 吕振新
[Data structs] kruskal DL : 0: kruskal最小生成树的一种解决方法自己编写的已加注释-kruskal minimum spanning tree of a solution
Date : 2025-12-26 Size : 2kb User : Yang Ge
[Data structs] KRUSKAL DL : 0: * create a forest F (a set of trees), where each vertex in the graph is a separate tree * create a set S containing all the edges in the graph * while S is nonempty and F is not yet spanning o remove an edge with minimum weight from S o if that edge connects two different trees, then add it to the forest, combining two trees into a single tree o otherwise discard that edge. At the termination of the algorithm, the forest has only one component and forms a minimum spanning tree of the graph.- * create a forest F (a set of trees), where each vertex in the graph is a separate tree * create a set S containing all the edges in the graph * while S is nonempty and F is not yet spanning o remove an edge with minimum weight from S o if that edge connects two different trees, then add it to the forest, combining two trees into a single tree o otherwise discard that edge. At the termination of the algorithm, the forest has only one component and forms a minimum spanning tree of the graph.
Date : 2025-12-26 Size : 1kb User : synthia
[Data structs] MiniSpanTree-Kruskal DL : 0: 克鲁斯卡尔算法(Kruskal s algorithm)是两个经典的最小生成树算法的较为的该算法的代码进行了综合和改进，把各个版本存在的简单理解的一个。本程序对网上的很多版本错误都进行了改正，并用多个例子进行测试。欢迎大家找出错误。-Kruskal s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. If the graph is not connected, then it finds a minimum spanning forest (a minimum spanning tree for each connected component). Kruskal s algorithm is an example of a greedy algorithm.
Date : 2025-12-26 Size : 4kb User : qinxiangju
[Data structs] Minimum-spanning-tree DL : 0: Kruskal算法和Prim算法任何只由G的边构成,并包含G的所有顶点的树称为G的生成树(G连通). 加权无向图G的生成树的代价是该生成树的所有边的代码(权)的和. 最小代价生成树是其所有生成树中代价最小的生成树.-Kruskal algorithm and Prim algorithm Any edge of only by G, is composed of all the vertices containing G tree called G of the spanning tree (G connected). The weighted no directed graph G is the price of spanning tree all the spanning tree right on the edge of the code () and. The lowest cost spanning tree is in all its spanning tree minimum cost of the spanning tree.
Date : 2025-12-26 Size : 1kb User : 江洋
[Data structs] Kruskal DL : 0: 采用Kruskal算法求最小生成树主要数据结构 edgeset GE 存放图中的所有边 int n,int e 存放图中的顶点数与边数 edgeset C 存放生成树中的边 vexlist gv 图中结点的顶点值 adjmatrix s 用来处理图中结点的查找与合并 int m1,m2 一条边上两顶点所属集合的序号 int k 最小生成树中的边数 int d //图中待扫描边元素的下标-For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript
Date : 2025-12-26 Size : 2kb User : mgh

« 12 3 4 5 »