Search - kruscal algorithm

Search - kruscal algorithm - List

[Data structs] MST_without input DL : 0: kruscal的源代码，实现最小生成树的算法，这个是本人自己编的小程序。-kruscal the source code to achieve the minimum spanning tree algorithm, this is my own small part of the process.
Date : 2026-01-08 Size : 1kb User : 涂奎
[Data structs] KRUSCAL DL : 0: Kruscal算法实现产生最小生成树，适用学习二叉树的朋友-Kruscal have a minimum spanning tree algorithm, the application of learning tree friends
Date : 2026-01-08 Size : 1kb User : li
[Data structs] tudebianli DL : 0: 图的遍历和生成树求解实现（邻接矩阵、邻接表 ―图的深度广度遍历算法的实现和最小生成树PRIM和KRUSCAL算法的实现） -Graph Traversal and Spanning Tree Solution implementation (adjacency matrix, adjacency list- map the depth of breadth traversal algorithm and implementation of the minimum spanning tree algorithm PRIM and implementation KRUSCAL)
Date : 2026-01-08 Size : 9kb User : xqx
[Data structs] spanning_tree DL : 0: 最小生成树的Prim 和Kruscal算法-Prim minimum spanning tree algorithm and Kruscal
Date : 2026-01-08 Size : 1kb User : chenjinxin
[Data structs] Graph-traversal-spanning-tree DL : 0: 1．显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量。 2．当用户选择的功能错误时，系统会输出相应的提示。 3．通过图操作的实现，把一些实际生活中的具体的事物抽象出来-Shown FIG s adjacency matrix, graph the adjlink, depth-first traversal, breadth first traverse, minimum spanning tree minimum spanning tree PRIM algorithm, KRUSCAL algorithm, graph the connected components. 2. When the user chooses function mistake, the system will be output corresponding hints. 3. Through the realization of the operation, the graph of some actual life in the specific things abstract out
Date : 2026-01-08 Size : 1kb User : 江洋
[Data structs] LJJZ DL : 0: 显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量-Shows the adjacency matrix, adjacency table, depth-first traversal, breadth-first traversal, minimum spanning tree PRIM algorithm, minimum spanning tree KRUSCAL algorithm, graph connected component
Date : 2026-01-08 Size : 3kb User : 周佳雯
[Data structs] Kruscal DL : 0: 快排并查集Kruscal算法+源码 txt 快排并查集Kruscal算法+源码 txt-Row and fast algorithm+ source code search set Kruscal txt row and check the set Kruscal fast algorithm+ source code txt
Date : 2026-01-08 Size : 1kb User : wjt
[Data structs] liu DL : 0: 深度优先遍历广度优先遍历最小生成树PRIM算法最小生成树KRUSCAL算法 -Breadth-first traversal depth-first traversal algorithm for minimum spanning tree minimum spanning tree KRUSCAL PRIM algorithm
Date : 2026-01-08 Size : 42kb User : 海宁
[Data structs] scj_Graph DL : 0: 数据结构中有关图的创建，存储显示，深度，广度优先遍历算法，以及最小生成树Prim和Kruscal算法实现-The map data structure to create, store display, the depth, breadth-first traversal algorithm, and Prim minimum spanning tree algorithm and Kruscal
Date : 2026-01-08 Size : 1.76mb User : scj
[Data structs] test10 DL : 0: （1）掌握图的邻接矩阵、邻接表、十字链表等不同存储形式的表示方法。（2）掌握图的两种不同遍历方法的基本思想并能编程实现。（3）掌握构造最小生成树的两种算法，即Prim 算法和Kruscal算法的思想，并能编程实现。（4）能够灵活运用图的相关算法解决相应的实际问题。 -(1) master the adjacency matrix, adjacency list, cross-linked forms of representation of different storage methods. (2) two different master plans through the basic idea and can be programmed. (3) control construct two algorithms for minimum spanning tree, that Prim algorithm and Kruscal algorithm ideas, and to programming. (4) flexibility to use the corresponding graph-related algorithms to solve practical problems.
Date : 2026-01-08 Size : 1kb User : yuan li
[Data structs] data-structure-Graph DL : 1: 本软件围绕无向图的应用这一主题，用图形化的界面实现了无向图的建立、显示邻接表、动态构造最小生成树（分别利用Prim算法和Kruscal算法）、查找最短路径等功能。具体功能：给定一个图，完成：（1）建立并显示出它的邻接链表（2）分别用普里姆算法和克鲁斯卡尔算法构造其最小生成树，随时显示其构造的过程（3）给出某一确定顶点到所有其他顶点的最短路径（4）给出每一对顶点之间的最短路径说明：程序开发时所用的文件和源码在文件夹“配套文件”中提供。另附说明文档。-This software around the theme of directed graph, use the graphical interface to achieve the establishment of an undirected graph, showing the adjacent table, the dynamic construction of minimum spanning tree (Prim algorithm and Kruscal algorithm), find the shortest path. Specific features: Given a graph, complete: (1) to establish and demonstrate its adjacency lists (2) the algorithm of Prim and Kruskal algorithm construct the minimum spanning tree, ready to show the process of its construction (3) gives the shortest path to determine a vertex to all other vertices (4) gives the shortest path between each pair of vertices Description: used in program development and source files in the folder "supporting documents". Attach a separate sheet document.
Date : 2026-01-08 Size : 2.91mb User : lsc
[Data structs] graph DL : 0: 几乎包含了图的所有操作，邻接矩阵，邻接表建立，递归非递归深搜广艘遍历，floyd,prim,kruscal,地界斯特拉算法，拓扑排序，关键路径-Figure includes almost all the operations, the adjacency matrix, adjacency list creation, deep search recursive non-recursive traversal wide ship, floyd, prim, kruscal, boundary Stella algorithm, topological sorting, the critical path
Date : 2026-01-08 Size : 1.38mb User : 宁淡淡