Search - kruskal

Search - kruskal - List

[Data structs] Kruskal算法 DL : 0: Kruskal算法
Date : 2009-04-23 Size : 1.74kb User : luqunru
[Data structs] 1kruskal DL : 0: KRUSKAL算法-KRUSKAL Algorithm
Date : 2026-01-10 Size : 1kb User : liao
[Data structs] KruskalAlgorithm DL : 0: 本文件主要完成Kruskal算法。本文件包括三个类，分别是顶点类、边类和Kruskal类。-The document completed Kruskal algorithm. This document consists of three categories, namely category vertex, edge type and Kruskal category.
Date : 2026-01-10 Size : 1kb User : 韩希先
[Data structs] 数据结构算法集锦 DL : 0: 数据结构算法集锦：包括大量常用算法，如求两数的最大公约数、素数的求法、Prim算法、Kruskal算法、最短路径、Dijkstra 算法、排序相关算法、高精度计算相关算法-algorithm data structure highlights include : large common algorithms, such as for the number two majors, for the prime numbers, Prim algorithm, Kruskal algorithm, the shortest path, the Dijkstra algorithm, scheduling algorithms, high-precision calculation algorithms, etc.
Date : 2026-01-10 Size : 9kb User : 美美
[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 : 2026-01-10 Size : 2kb User :
[Data structs] Kruskal DL : 0: 一个用vc实现的Kruskal算法，程序流程非常清晰，有助于对算法的理解。-a vc achieved using Kruskal algorithm, program flow is very clear, contribute to the understanding of the algorithm.
Date : 2026-01-10 Size : 282kb User : 刘后
[Data structs] Kruskal DL : 0: 按克鲁斯卡尔（Kruskal）算法思想，编制一个寻找最小生成树的完整的程序。
Date : 2026-01-10 Size : 1kb User : 杨襄
[Data structs] KRUSKAL DL : 0: 最小生成树－KRUSKAL算法，做了很长时间才做好的-Minimum Spanning Tree-KRUSKAL algorithm, so a long time to do a good job of
Date : 2026-01-10 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 : 2026-01-10 Size : 1kb User : liangliu
[Data structs] Kruskal DL : 0: Kruskal算法的实现，内容详见说明开发环境为VS2003 -Kruskal algorithm, as detailed in note VS2003 development environment for
Date : 2026-01-10 Size : 5kb User : 保密
[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 : 2026-01-10 Size : 1kb User : ruikobe
[Data structs] kruskal DL : 0: kruskal算法，数据结构中贪心算法的C语言实现。-Kruskal algorithm, data structure of the greedy algorithm in C language.
Date : 2026-01-10 Size : 1kb User : jason
[Data structs] kruskal DL : 0: kruskal算法很经典的使用C语言实现，在数据结构中很实用-Kruskal algorithm is a classic use of C language, data structure in a very practical
Date : 2026-01-10 Size : 1kb User : changzhuo
[Data structs] KrusKal DL : 0: 对一个带权无向图，求其最小生成树，本程序功能通过KrusKal算法实现。-Of a weighted undirected graph, and its minimum spanning tree, the program features through the Kruskal algorithm.
Date : 2026-01-10 Size : 99kb User : 傅山
[Data structs] Prim-Kruskal-Dijkstra DL : 0: 数据结构课程设计据结构课程设计范例\Prim-Kruskal-Dijkstra.rar-Data structure, according to the structure of curriculum design curriculum design examples \ Prim-Kruskal-Dijkstra.rar
Date : 2026-01-10 Size : 43kb User : zhang fei
[Data structs] Kruskal DL : 0: 数据结构中经典的Kruskal算法的java实现，Java版-Data structure in the classical Kruskal algorithm java implementation, Java Edition
Date : 2026-01-10 Size : 2kb User : happywh wang
[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 : 2026-01-10 Size : 4kb User : qinxiangju
[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 : 2026-01-10 Size : 2kb User : mgh
[Data structs] Kruskal DL : 0: 克鲁斯卡尔算法，实现最小生成树，并且可以通过参数控制连通分支的数量-Kruskal algorithm for minimum spanning tree and connected components can be controlled by the number of parameters
Date : 2026-01-10 Size : 34.1mb User :
[Data structs] MST-kruskal DL : 0: The classic kruskal algorithm is implemented Import: adjacency matrix Output: Minimum spanning tree
Date : 2026-01-10 Size : 1kb User : 曾经的故事

« 12 3 4 5 6 7 8 9 10 »