搜索资源列表
1kruskal
- KRUSKAL算法-KRUSKAL Algorithm
KruskalAlgorithm
- 本文件主要完成Kruskal算法。本文件包括三个类，分别是顶点类、边类和Kruskal类。-The document completed Kruskal algorithm. This document consists of three categories, namely category vertex, edge type and Kruskal category.
数据结构算法集锦
- 数据结构算法集锦：包括大量常用算法，如求两数的最大公约数、素数的求法、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_tree.rar
- matlab实现的最小生成树的两种最基本的算法即Kruskal，Prim。,matlab realization of the minimum spanning tree algorithm that is, the two most basic Kruskal, Prim.
minspant
- 最小生成树，prim算法 还有kruskal算法 两个算法的具体实现还有测试-Minimum spanning tree, prim algorithm also kruskal algorithm implementation has two specific test algorithm
zuixiaoshengchengshu.rar
- 1． 利用克鲁斯卡尔算法求网的最小生成树 2.以存储边（带权）的数组表示图,1. Kruskal algorithm using minimum spanning tree for network 2. To store edge (with the right of) the array that map
Discrete optimization
- 它包含了枚举法、蒙特卡洛法、线性整数规划、整数规划枚举法、整数规划隐枚举法、非线性整数规划、非线性整数规划图形工具、最小生成树kruskal算法、最短路dijkstra算法、最小生成树kruskal算法mex程序、最短路dijkstra算法mex程序和动态规划的代码。-It contains the matlab code of the enumeration method, Monte Carlo method, linear integer programming, integer prog
min_tree
- Kruskal算法的M程序，主要用于图论问题。最终求出要求的最小树问题。-Kruskal algorithm M program, mainly for graph theory problems. Eventually find the required minimum tree problem.
Minimum-spanning-tree
- 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 spannin
GraphTheoryAlgorithmMATLAB
- 图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.-Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V
test_kruskal
- 数据结构与算法-程序、素材\Kruskal构造算法-Data Structures and Algorithms- procedures, materials Kruskal Algorithm
collection_treeset
- 运用java 实现Kruskal 算法 计算树的重量最小 覆盖最大-Java application Kruskal algorithm to achieve the weight of the smallest tree cover the largest
FFF
- 用Kruskal算法求最小生成树，算法与分析实验-Using Kruskal algorithm for minimum spanning tree, Algorithm and Analysis of Experiments
346
- 绘制表格 Kruskal算法求得的最小生成树-Drawing forms obtained Kruskal minimum spanning tree algorithm
MSTkruskal
- 最小生成树的kruskal算法实现 使用mfc显示界面（可以随机生成边）-Kruskal minimum spanning tree algorithm using mfc display interface (can be randomly generated edge)
datastruct_flash
- 数据结构算法的flash动画演示，形象生动地说明了链表、栈、队列等操作的流程。-Data Structure Algorithm Animation flash, image vividly illustrates linked list, stack, queue operations, such as flow.
shujvjiegousuanfa
- 数据结构中的各种算法PPT，包括迪杰斯特拉算法，克鲁斯卡尔算法等。-Data structure of the various algorithms PPT, including the Dijkstra algorithm, Kruskal algorithm.
kruskal
- 本算法是一个关于kruskal的源码实现,可供大家学习研究.-This algorithm is a source about the implementation kruskal for U.S. study.
tt
- 用KRUSKAL算法求最短路径,可以运行C++源程序-KRUSKAL algorithm used for the shortest path, you can run C++ source code
2.Greedy
- 该文件夹包含一系列常用的贪婪算法集合，其中包含经典的克鲁斯卡尔算法，普利姆算法。-The folder contains a series of commonly used collection of greedy algorithm, which includes the classical Kruskal algorithm,普利姆algorithm.