Location:
Search - kruskal
Search list
Description: Kruskal算法，Kruskal算法的时间复杂度为 ，与图中边数有关，而与图中的顶点数无关，因此该算法适合与求边稀疏的网的最小生成树。-Kruskal algorithm, the algorithm Kruskal time complexity of, and chart the edge, with map unrelated to the number of vertices, and the algorithm for edge for the sparse network of minimum spanning tree.
Platform: |
Size: 6144 |
Author: gdfgdfg |
Hits:
Description: c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Platform: |
Size: 144384 |
Author: liulei |
Hits:
Description: c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Platform: |
Size: 3072 |
Author: liulei |
Hits:
Description: 演示Kruskal算法和Prim算法
集合的并,元素查找的操作及应用
说明:
代码均在vc++6.0环境下编译均通过
在非VC++6.0环境下编译请去掉头文件 windows.h 和函数 end()
-Demo Kruskal algorithm and Prim algorithm and collection, elements of the search operation and application notes: code in vc++ 6.0 compiler environment through in non-VC++ 6.0 compiler environment please go to the U-turn paper windows.h and function end ()
Platform: |
Size: 1024 |
Author: 毕小凯 |
Hits:
Description: 图论中最小生成树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)
Platform: |
Size: 1024 |
Author: lluo |
Hits:
Description: 包含Dijkstra、Floyd、kruskal、动态规划、随机数生成等MATLAB程序-Contains Dijkstra, Floyd, kruskal, dynamic programming, random number generator, such as MATLAB program
Platform: |
Size: 149504 |
Author: chen |
Hits:
Description: matlab程序，包括kruskal算法和kijkstra算法的程序
Platform: |
Size: 2048 |
Author: 随风 |
Hits:
Description: 分别利用prim算法和kruskal算法实现求图的最小生成树,感觉学习最小生成树的时候有挺多问题,这里是一个用PRIM和KRUSKAL算法做的一个最小生成树算法-, Respectively, using prim algorithm and Kruskal Algorithm for Minimum Spanning Tree, Minimum Spanning Tree feels when learning挺多have problems, here is an algorithm with PRIM and KRUSKAL make a minimum spanning tree algorithm
Platform: |
Size: 1024 |
Author: dialy |
Hits:
Description: 最小生成树的Kruscal算法。Visual Studio2005
Platform: |
Size: 1024 |
Author: 刘帅 |
Hits:
Description: 约瑟夫环问题，此源码是对约瑟夫环问题使用链表进行实现的。-Joseph Central issues, the source of Joseph Central issues to realize the use of linked lists.
Platform: |
Size: 1024 |
Author: 北辰 |
Hits:
Description: 最小生成树是数据结构中图的一种重要应用,它的要求是从一个带权无向完全图中选择n-1条边并使这个图仍然连通...为了得到最小生成树,人们设计了很多算法,最著名的有prim算法和kruskal算法。-Minimum spanning tree data structure is an important application of graph, and its request is from a weighted undirected complete graph to select n-1 edges and the graph is still connected ... in order to get minimum spanning tree, it is designed a lot of algorithms, the most famous are prim algorithm and Kruskal algorithm.
Platform: |
Size: 1024 |
Author: 0000 |
Hits:
Description: 实现图的最短路径寻找-The realization of plans to find the shortest path
Platform: |
Size: 267264 |
Author: moxianwen |
Hits:
Description: 最小生成树 用克鲁斯卡尔算法求网的最小生成树-Minimum spanning tree algorithm used for network Kruskal minimum spanning tree
Platform: |
Size: 8192 |
Author: |
Hits:
Description: 解决图论中Warshall-Floyd 算法，Kruskal 避圈法，匈牙利算法，求最佳匹配的算法，求最大流的Ford--Fulkerson 标号算法，求解最小费用流问题的matlab程序-Solve the graph theory Warshall-Floyd algorithm, Kruskal avoid lap law, Hungary algorithm, and the best matching algorithm, for maximum flow of the Ford- Fulkerson labeling algorithm for solving the minimum cost flow problem of matlab procedures
Platform: |
Size: 47104 |
Author: yangfei |
Hits:
Description: 最小生成树的kruskal算法之二.rar-Minimum Spanning Tree Algorithm Kruskal bis. Rar
Platform: |
Size: 176128 |
Author: sandra |
Hits:
Description: 最小生成树的kruskal算法之一.rar-Minimum spanning tree, one of the Kruskal algorithm. Rar
Platform: |
Size: 163840 |
Author: sandra |
Hits:
Description: Vc++实现最短路径，利用Kruskal算法，属于数据结构习题-Vc++ To achieve the shortest path, using Kruskal algorithms, data structures belonging to Exercises
Platform: |
Size: 169984 |
Author: 张婷 |
Hits:
Description: 最小生成树~~~~Kruskal算法建立最小生成树，并计算得到的最小生成树的代价。
-Minimum Spanning Tree ~ ~ ~ ~ Kruskal minimum spanning tree algorithm, and calculate the cost of the minimum spanning tree.
Platform: |
Size: 2048 |
Author: ala |
Hits:
Description: 图的算法实现
（1）将图的信息建立文件；
（2）从文件读入图的信息，建立邻接矩阵和邻接表；
（3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。
-Graph Algorithms (1) will map the information to create the document (2) read from the document map information, the establishment of adjacency matrix and adjacency list (3) the realization of Prim, Kruskal, Dijkstra, and topological sorting algorithm.
Platform: |
Size: 105472 |
Author: 陈阳 |
Hits:
Description: 图的算法实现
（1）将图的信息建立文件；
（2）从文件读入图的信息，建立邻接矩阵和邻接表；
（3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。
-Graph Algorithms (1) will map the information to create the document (2) read from the document map information, the establishment of adjacency matrix and adjacency list (3) the realization of Prim, Kruskal, Dijkstra, and topological sorting algorithm.
Platform: |
Size: 28672 |
Author: 陈阳 |
Hits:
«
1
2
3
4
56
7
8
9
10
...
28
»