搜索资源列表
tudejibensuanfashixian
- 图的基本算法:主要包括普里姆算法和克鲁斯卡二算法。-The basic graph algorithms: including Prim algorithm and Kruskal II algorithm.
chengxu
- 图论中最小生成树Kruskal算法 及画图程序 M-函数-Kruskal minimum spanning tree in graph theory, algorithms and functions for M-Drawing
Kruskal
- VC++代码实现连通图最小生成树的Kruskal算法-VC++ code connected graph Kruskal minimum spanning tree algorithm
MATLAB-algorithm-and-program-code
- 图论算法及matlab程序代码包含求任两点间最短路径的算法及代码Floyd、kruskal,最大匹配的匈牙利算法,并使用matlab程序实现。-Graph algorithms and matlab code includes the algorithm(Floyd, kruskal, maximal matching algorithm of Hungary,) to solve the shortest path between two points, and use matlab prog
Algorithm-template
- C++ 写的一些算法模板 ,比如Kruskal、KMP、欧几里德算法、最大匹配(匈牙利算法)、最小费用最大流、字符串的哈希方法、增广路算法、网络最大流_邻接表等-C++ write some algorithms template, such as Kruskal, KMP, Euclid arithmetic, maximal matching (Hungary) is proposed, the minimum cost and maximum flow, string hash metho
TuSuanFa
- 图算法,创建无向图,实现深度优先搜索和宽度优先搜索,用到队列和Kruskal算法。-Figure algorithm, create no to figure, realize the depth first search and width first search, use queue and Kruskal algorithm.
Krusf
- 求最小生成树的Kruskal算法 边权矩阵的产生方法: 1)一般的边权矩阵,为nxn维。调用方式[T c]=Krusf(d) 2)边权矩阵的前两行分别记录图上所有边的起始顶点和终止顶点, 无向边不重复记录。第三行记录对应边的权值。调用方式为[T c]=Krusf(d,1) c:生成树的费用 T:生成树的边集合 -The Kruskal minimum spanning tree algorithm
161226
- c++实现prim算法和kruskal算法-c++ language implement prim algorithm and kruskal algorithm