Search - prim algorithm

Search - prim algorithm - List

[Data structs] 最小生成树1 DL : 0: 本程序是一个用prim算法寻找最小生成树的小程序。-this procedure is a prim with minimum spanning tree algorithm for small procedures.
Date : 2026-01-23 Size : 75kb User : 王
[Data structs] 数据结构算法集锦 DL : 0: 数据结构算法集锦：包括大量常用算法，如求两数的最大公约数、素数的求法、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 shortest path, the Dijkstra algorithm, scheduling algorithms, high-precision calculation algorithms, etc.
Date : 2026-01-23 Size : 9kb User : 美美
[Data structs] 最小生成树prim算法 DL : 0: 最小生成树的prim算法是求图中的最短路径的一个重要算法但是是O(n2)复杂度的一个算法-minimum spanning tree algorithm is the prim map for the shortest path algorithm of an important but is O (n2) of a complex algorithm
Date : 2026-01-23 Size : 3kb User : 袁文
[Data structs] Prim_gao DL : 0: Prim 算法寻找最小生成树，用C语言实现，有完整的注释！-Prim algorithm to find the minimum spanning tree, using C language, a complete Notes!
Date : 2026-01-23 Size : 1kb User : gao
[Data structs] Prim算法构造最小生成树 DL : 0: 数据结构中的prim算法构造最小树的算法。课程作业要求-data structure constructed Prim algorithm of most trees algorithms. Courses operational requirements
Date : 2026-01-23 Size : 24kb User : emma
[Data structs] 13.用普里姆(Prim)算法构造最小生成树 DL : 0: 用普里姆(Prim)算法构造最小生成树数据结构的基本应用，适合初学者-with Primbetov (PRIM), the minimum spanning tree algorithm tectonic structure of the basic data applications, suitable for beginners
Date : 2026-01-23 Size : 2kb User : 阿水
[Data structs] 图论算法库 C++ 语言实现 DL : 0: 图论算法库 C++ 语言实现代码内容图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -graph algorithm for C language code content graph algorithm library, including the following algorithm : single-source shortest path algorithm Dijkstra single source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall ALGOL C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, the VisualAge C 4.0 debugging through. The compressed file contains all Graph.h the library, the procedure call interface, see the Notes. Other documents algorithm is used to test the test procedures in VisualAge C compiler running under 4.0. The algorithm is for me to participate in ACM/Illinois prepared to contest the information, because the competition for high speed
Date : 2026-01-23 Size : 10kb User : 罗鹏魁
[Data structs] MapGuid DL : 0: 我写的,画出最短路径,及最小生成树 Prim Dijistra算法+ GDI实现-I write to depict the shortest path, and the smallest Prim Dijistra Spanning Tree Algorithm to achieve GDI
Date : 2026-01-23 Size : 1.85mb User : nick
[Data structs] prim DL : 0: prim算法的原理利用 prim算法构造最小生成树。有机的应用prim和数组存储生成树。-prim algorithm using the principle of Minimum Spanning Tree Algorithm prim. Application of organic prim and storage arrays spanning tree.
Date : 2026-01-23 Size : 2kb User : chenweihuan
[Data structs] Prim DL : 0: 数据结构中用普里姆(Prim)算法构造最小生成树 -Data structure using prim (Prim) Minimum Spanning Tree Algorithm
Date : 2026-01-23 Size : 1kb User : 王振兴
[Data structs] prim DL : 0: 掌握Prim算法的特点，学会用Prim算法构造最小生成树如果无向连通图是一个网，那么它的所有生成树中必有一棵树的边的权值总和为最小，我们称这棵生成树为最小生成树。在Prim算法中，在图G=(V,E)（V表示顶点，E表示边）中任选一点V0，令集合U={V0}为初态，从V0出发寻找与U中顶点相邻（另一顶点在V中）且代价最小的边的另一顶点V1，并使V1加入U，即U={V0，V1}，同时（V0，V1）边加入集合T中（T的初态为空），这样不断地扩大U,直到U=V，则T中即为最小生成树的边。 -Grasp the characteristics of Prim algorithm, learning algorithm constructed by Prim minimum spanning tree if the undirected connected graph is a network, then it must be all the spanning tree in the side of a tree weight value sum for the smallest, spanning tree, we called for minimum spanning tree. In the Prim algorithm, in Figure G = (V, E) (V said vertex, E said that edges) in one point V0, the collection U = (V0) for the initial state, starting from V0 to find the adjacent vertex of U (another vertex in V in) and the cost of the other side of the smallest vertex V1, and V1 to join U, namely U = (V0, V1), at the same time (V0, V1) to include in the collection side of T in (T of the initial state is empty), this continues to expand U, until U = V, then T is the minimum spanning tree in the side.
Date : 2026-01-23 Size : 1kb User : 燕
[Data structs] prim DL : 0: prim算法是从连通网中的某一个顶点开始，以此作为生成树的初始状态，然后不断的将网中的其他顶点添加到生成树上，直到最后一个顶点添加到生成数上时得到最小生成树．-prim algorithm is network connectivity from a vertex to start, as a spanning tree of the initial state, and then continuing to network other vertex added to the spanning tree until the last vertex added to the generated number to be the smallest when Spanning Tree.
Date : 2026-01-23 Size : 8kb User : 陈冰晶
[Data structs] Prim DL : 0: Prim算法的实现，内容详见说明开发环境为VS2003 -Prim algorithm, content development environment for the detailed description VS2003
Date : 2026-01-23 Size : 6kb User : 保密
[Data structs] prim DL : 0: (1)利用普里姆算法求网的最小生成树 (2)实现教科书中定义的抽象数据类型mfset。以此表示构造生成树过程中的连通分量。 (3)以文本形式输出生成树中各条边以及他们的权值-(1) the use of prim algorithm for minimum spanning tree network (2) the realization of the textbook definition of abstract data types mfset. Spanning tree structure to express the process of component connectivity. (3) to text output of all spanning tree edges and their weights
Date : 2026-01-23 Size : 1kb User : xinghenzhai
[Data structs] Prim DL : 0: 用普里姆(Prim)算法构造最小生成树,满分作业，运行无错的-With prim (Prim) Minimum Spanning Tree Algorithm, out of operation, run no wrong
Date : 2026-01-23 Size : 160kb User : 海瑞
[Data structs] report+of+Algorithm DL : 0: 算法设计的实验报告包括Bottom-Up Merge Sorting算法、插入排序算法Heaps的创建堆、堆排序算法、按秩合并算法以及带路径压缩算法、实现查找第K小元素算法、实现快速排序算法、实现平面内最接近点对算法、实现最长公共子序列算法、实现矩阵链相乘算法、实现0/1背包问题算法、实现Dijistra’s算法、Prim算法、Kruskal算法、文件压缩算法-Experimental Algorithm Design Report including Bottom-Up Merge Sorting Algorithm, Insertion Sort algorithm creation Heaps Heap, Heap Sort algorithm, according to rank and merge algorithm with path compression algorithm to find the first small element K algorithm, the realization of quick sort algorithm, the realization of planar within the nearest point on the algorithm to achieve the longest common sub-sequence algorithm, the realization of matrix-chain multiplication algorithm, the realization of 0/1 knapsack problem algorithm Dijistra s algorithm, Prim algorithm, Kruskal algorithm, file compression algorithm
Date : 2026-01-23 Size : 28kb User : 苏宁
[Data structs] prim DL : 0: prim算法是将一个无向图生成最小生成树的算法。其中一个是用最下堆实现的，已在压缩包的txt文件中说明。-prim algorithm is an undirected graph generated minimum spanning tree algorithms. One of them is the most under the heap to achieve, has been compressed package txt-documented.
Date : 2026-01-23 Size : 8kb User : liuhua
[Data structs] prim DL : 0: vc环境下用Prim 算法生成图的最小生成树-vc environment using Prim algorithm to generate the minimal spanning tree
Date : 2026-01-23 Size : 175kb User : weiwei
[Data structs] Prim-algorithm DL : 0: 本程序是用c语言来编程实现Prim算法，希望对别人有帮助！-This procedure is used c programming language Prim algorithm, we want to help others!
Date : 2026-01-23 Size : 1kb User : 代伟
[Data structs] prim DL : 0: 最小生成树prim算法，用于处理图论知识比较有用(Minimum spanning tree prim algorithm)
Date : 2026-01-23 Size : 1kb User : 土拨鼠1

« 12 3 4 5 6 7 8 »