Description: 利用prim算法来计算最小生成树,对于数据结构学习者有很大帮助,利用邻接矩阵来存储图-Prim algorithm used to calculate the minimum spanning tree, the data structure for the learner is very helpful to use the adjacency matrix storage plan Platform: |
Size: 169984 |
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: 最小生成树kruskal算法用邻接矩阵做图-Kruskal minimum spanning tree algorithm to do with adjacency matrix graph Platform: |
Size: 1024 |
Author:yan yao |
Hits:
Description: 对任意给定的网络（顶点数和边数自定），建立它的邻接矩阵并输出，然后利用Prim算法或Kruskal算法生成它的最小生成树，并输出结果。-On any given network (the number of vertices and edges from the set), the establishment of its adjacency matrix and output, and then use Prim algorithm or Kruskal algorithm to generate its minimum spanning tree, and output results. Platform: |
Size: 11264 |
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: 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:
Description: 程序给出邻接表中的边结点的类型、邻接矩阵类的定义。利用KRUSKAL方法求边集数组的GE的最小生成树，树中每条边一次存于数组C中并给出了邻接矩阵类的实现，最后对邻接矩阵类主要操作进行测试，并输出运行结果。-Procedures are given in the table edge adjacent node types, the definition of adjacency matrix category. Method use KRUSKAL margination array of GE s minimum spanning tree, each side of a tree stored in an array in C and category adjacency matrix is given the realization of the final major of the adjacency matrix to test the operation and output results. Platform: |
Size: 3072 |
Author:cool |
Hits:
Description: 最小生成树的克鲁斯卡尔算法
采用邻接矩阵存储图，用树表示和实现集合操作-Kruskal minimum spanning tree algorithm uses the adjacency matrix memory map, with trees and realize that the collection operation Platform: |
Size: 19456 |
Author:刘生生 |
Hits:
Description: 最小生成树kruskal原程序——根据数据结构最小生成树的邻接矩阵- Minimum Spanning Tree kruskal of the original program- the data structure of the adjacency matrix of the minimum spanning tree Platform: |
Size: 2048 |
Author:ldmmei |
Hits:
Description: 这个源代码包含了图的邻接矩阵和链表的两种存储方式、深度和广度的遍历以及prim
和kruskal最短路径两种算法。-The source code contains the adjacency matrix and list two storage mode, the breadth and depth of the traversal and prim
And kruskal shortest path of two algorithms. Platform: |
Size: 2048 |
Author:cyy |
Hits:
Description: prim算法
kruskal算法用matlab实现
输入标准：x邻接矩阵 p节点集
输出：生成树边集 G-the prim algorithm kruskal algorithm using matlab input standard: x adjacency matrix p node set output: spanning tree edge set of G Platform: |
Size: 1024 |
Author:陈小文 |
Hits:
Description: kruskal算法，可以用来解决最小生成树的问题，本算法已经改进，可以直接输入邻接矩阵计算便可-kruskal algorithm can be used to solve the minimum spanning tree problem, the algorithm has been improved, you can directly enter the adjacency matrix can be calculated Platform: |
Size: 1024 |
Author:周瑜 |
Hits:
Description: 1.掌握图的基本存储方法：邻接矩阵和邻接表（本程序中使用邻接矩阵）；
2.掌握有关图的基本操作算法并能使用高级语言实现（本程序使用C语言）；
3.掌握图的深度优先搜索遍历和广度优先搜索遍历算法；
4.掌握图的最小生成树的两种算法：prim算法和kruskal算法。
5.掌握图的最短路径的两种算法：DIJ算法和floyd算法。
-1 The basic storage methods mastered graph: adjacency matrix and adjacency list (the adjacency matrix used in the program)
2 master basic operations related to graph algorithms and high-level language can be used to achieve (the program uses C language)
3 master depth-first search and breadth-first traversal traversal search algorithm
4 master plans of the two minimum spanning tree algorithm:. Prim algorithm and kruskal algorithm.
5 master shortest path of two algorithms:. DIJ algorithm and floyd algorithm. Platform: |
Size: 4096 |
Author:奋斗菠萝 |
Hits:
Description: 掌握图的两种存储结构；
掌握Dijkstra算法；
掌握Prim及Kruskal算法；
邻接矩阵、最短路径及其长度
邻接表、最小生成树
-Learn two storage structure
Master Dijkstra algorithm
Master Prim and Kruskal algorithm
Adjacency matrix, and the length of the shortest path
Adjacent table, the minimum spanning tree Platform: |
Size: 191488 |
Author:高菲 |
Hits:
Description: 基于Virtual C++的数据结构中图的应用，能实现从文件输入有向图和无向图易邻接表和邻接矩阵的形式在屏幕输出，同时能实现无向图的深度遍历输出和广度遍历输出；kruskal算法和Prim算法实现最小生成树的创建；Dijkstra算法实现最短路径的计算；以及最小偏心距的计算。-Application of data structure of Virtual in C++ based on graph, can be achieved the file input directed graphs and undirected graph adjacency list and the adjacency matrix is easy to form on the screen output, at the same time, can realize the undirected graph depth first traversal and breadth traversal output output Kruskal algorithm and Prim algorithm to achieve the creation of the Oki Nariki Dijkstra algorithm the shortest path calculation and the calculation of minimum eccentricity. Platform: |
Size: 1080320 |
Author:易新宇 |
Hits:
Search - kruskal Adjacency matrix