Location:
Search - PRIM
Search list
Description: 用java语言编写一个java应用程序根据给定图实现最小生成树(Minimal Spinning Tree),可以采用Prim算法和Kruskal算法，并用动画的方式表示最小生成树的生成过程。
Platform: |
Size: 2857 |
Author: markmiss@foxmail.com |
Hits:
Description: prim算法，自己做的
Platform: |
Size: 1095893 |
Author: 402064605 |
Hits:
Description: prim算法-prim Algorithm
Platform: |
Size: 1024 |
Author: arthur |
Hits:
Description: 用Prim算法求最小生成树-Prim used for the minimum spanning tree algorithm
Platform: |
Size: 154624 |
Author: |
Hits:
Description: 最小生成树的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
Platform: |
Size: 3072 |
Author: 袁文 |
Hits:
Description: 数据结构中的prim算法构造最小树的算法。课程作业要求-data structure constructed Prim algorithm of most trees algorithms. Courses operational requirements
Platform: |
Size: 24576 |
Author: emma |
Hits:
Description: 这是一个用prim算法来得到最小生成树的程序-This is a prim algorithm used to be the minimum spanning tree procedures
Platform: |
Size: 1024 |
Author: yue |
Hits:
Description: 用普里姆(Prim)算法构造最小生成树；图的DFS算法的非递归遍历函数。-with Primbetov (PRIM), the minimum spanning tree algorithm constructs; Map of the DFS non- recursive algorithm traversal function.
Platform: |
Size: 4096 |
Author: 贾德 |
Hits:
Description: 用普里姆(Prim)算法构造最小生成树 数据结构的基本应用，适合初学者-with Primbetov (PRIM), the minimum spanning tree algorithm tectonic structure of the basic data applications, suitable for beginners
Platform: |
Size: 2048 |
Author: 阿水 |
Hits:
Description: prim算法的原理利用 prim算法构造最小生成树。有机的应用prim和数组存储生成树。-prim algorithm using the principle of Minimum Spanning Tree Algorithm prim. Application of organic prim and storage arrays spanning tree.
Platform: |
Size: 2048 |
Author: chenweihuan |
Hits:
Description: prim算法：可以从任意结点出发,找出与之相连的最小权值的结点,连接,把连接后的结点看成是一个整体,和其他的结点的权值比较,再找出最小权值的结点连接,然后将连接上的结点再看做一个整体,依次类推,直到所有结点全部连接上
代码、测试数据。-prim algorithm: You can start from any node to find the smallest connected node weight, connectivity, the connected node as a whole, and other nodes of the right value, and then find out the smallest weight node to connect, and then connect the node to do a whole look, and so on until all nodes all connected to code, test data.
Platform: |
Size: 12288 |
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: 算法分析与设计，基于随机生成的无向图的prim算法实现-Algorithm Analysis and Design, based on randomly generated undirected graph of the prim algorithm
Platform: |
Size: 2048 |
Author: dk liu |
Hits:
Description: PRIM求最小生成树，JAVA源程序，简洁易懂，很不错的。l-PRIM for minimum spanning tree, JAVA source, concise and understandable, it is good. l
Platform: |
Size: 1024 |
Author: 缪巍巍 |
Hits:
Description:
数据结构中用普里姆(Prim)算法构造最小生成树 -Data structure using prim (Prim) Minimum Spanning Tree Algorithm
Platform: |
Size: 1024 |
Author: 王振兴 |
Hits:
Description: 掌握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.
Platform: |
Size: 1024 |
Author: 燕 |
Hits:
Description: 用matlab语言编写的最小生成树的prim算法的通用源程序。-Using matlab language prim
Platform: |
Size: 5120 |
Author: 郝立颖 |
Hits:
Description: prim算法的vc++实现，适合初学者好好学习，愿与朋友们一起进步-prim algorithm vc++ realize is suitable for beginners to study hard, willing to progress together with friends
Platform: |
Size: 248832 |
Author: wyl_1113 |
Hits:
Description: (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
Platform: |
Size: 1024 |
Author: xinghenzhai |
Hits:
Description: 用普里姆(Prim)算法构造最小生成树,满分作业，运行无错的-With prim (Prim) Minimum Spanning Tree Algorithm, out of operation, run no wrong
Platform: |
Size: 163840 |
Author: 海瑞 |
Hits:
« 12
3
4
5
6
7
8
9
10
...
33
»