Location:
Search - prim
Search list
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: 实现了PRIM算法，可记录实验数据，并带有算法时间分析-err
Platform: |
Size: 1990656 |
Author: tan |
Hits:
Description: prim算法
kruskal算法用matlab实现
输入标准：x邻接矩阵 p节点集
输出：生成树边集 G-prim algorithm Kruskal algorithm matlab input standard: x adjacency matrix p Node Set Output: Spanning Tree margination G
Platform: |
Size: 1024 |
Author: yumeng |
Hits:
Description: 这是一个用于计算最小生成树的程序。当人们逐个输入每条边的权，再点击生成，便能得到这个图的最小生成树。-This is a used to calculate the minimum spanning tree procedure. When people enter one by one each side of the right, then click generate, will be able to get this graph minimum spanning tree.
Platform: |
Size: 2566144 |
Author: Jackey Chen |
Hits:
Description: 最小生成树，使用PRIM方法生成最小生成树。-Minimum Spanning Tree, use the PRIM method to generate minimum spanning tree.
Platform: |
Size: 1024 |
Author: luke |
Hits:
Description: matlab 经典程序 classic最佳生成树-matlab classic classic best spanning tree procedure
Platform: |
Size: 1024 |
Author: 岳明 |
Hits:
Description: 实现最小生成树算法,通过PRIM算法实现.通过输入一串字符显示最小生成树.求得最小路径-Realize minimum spanning tree algorithm, through the PRIM algorithm. By entering a string of characters show minimal spanning tree. Find the smallest path
Platform: |
Size: 5120 |
Author: 一一 |
Hits:
Description: 用java实现了最小求解连通图的最小生成树问题，采用的是prim算法，可供大家参考。-Using java realize the smallest connected graph for solving the minimum spanning tree problem, is the prim algorithm used for your reference.
Platform: |
Size: 4096 |
Author: gengxin |
Hits:
Description: 用prim算法实验最小生成树
本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树
定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。
定义二维数组g[ ][ ]来建立无向图的邻接矩阵。
-Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.
Platform: |
Size: 94208 |
Author: Tina612 |
Hits:
Description: prim算法,解决办公室通信埋线成本计算-prim algorithm, to solve the Office of Communications embedding costing
Platform: |
Size: 174080 |
Author: 邵逸风 |
Hits:
Description: 使用贪心算法实现PRIM最小生成树算法.经典的算法题目.-PRIM algorithm using the greedy algorithm for minimum spanning tree. Classic topics algorithm.
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 晕个是最小生成树Prim算法，现在在建模，急用算法，希望能够能过站长的审核-Halo is Prim minimum spanning tree algorithm, is now in the modeling, emergency algorithm, hope to be able to head off the audit
Platform: |
Size: 1024 |
Author: f |
Hits:
Description: 这个是严蔚敏版的数据结构上机教程中的部分源代码，都是自己写的，包括最短路径的dijkstra,floyd，最小生成树的prim,kruskal以及链表，Huffman Tree等等的c++代码-This is Yan Wei-min version of the data structure on the machine part of the tutorial source code, are written in their own, including the shortest path dijkstra, floyd, minimum spanning tree of the prim, kruskal as well as the list, Huffman Tree, etc. c++ code
Platform: |
Size: 12288 |
Author: wang yucao |
Hits:
Description: MALAB程序，包括顶点覆盖近似算法,哈密尔顿回路,画等温线,模拟退火应用,生成全排列矩阵,最小生成树Prim算法,最短路径等-MALAB procedures, including vertex cover approximation algorithm, Hamilton circuit, painting isotherms, simulated annealing applications, to generate full-rank matrix, Prim minimum spanning tree algorithm, the shortest path, etc.
Platform: |
Size: 45056 |
Author: john duan |
Hits:
Description: PKU中一些数据结构基本算法题的java实现，包括DIJ、PRIM、二叉查找树、并查集、动态规划、KMP、匈牙利算法、深搜广搜等-PKU some basic data structure algorithm java realization of the title, including DIJ, PRIM, binary search tree, and search sets, dynamic programming, KMP, the Hungarian algorithm, collected, such as deep-search
Platform: |
Size: 77824 |
Author: 俞昊旻 |
Hits:
Description: 最小生成树 采用C程序编程实现的PRIM算法-Minimum spanning tree using C programming algorithm to achieve the PRIM
Platform: |
Size: 1024 |
Author: Mary |
Hits:
Description: 二叉树中的prim最小生成树算法。编译环境：vistual stdio 2008-Binary tree in the minimum spanning tree algorithm prim. Compiler environment: vistual stdio 2008
Platform: |
Size: 24576 |
Author: guo |
Hits:
Description: 基于Prim算法的公路交通设计系统，开发环境VC++,简单编码，供大家参考-Prim algorithm based on the design of highway transportation system, development environment VC++, Simple encoding, for your reference
Platform: |
Size: 43008 |
Author: 李雪 |
Hits:
Description: 这是一个构造最小生成树的Prim算法，是属于贪心算法的范畴。设G=(V,E)是连同带权图，V={1，2，3，...，n}。构造G的最小生成树。-This is a structure of Prim minimum spanning tree algorithm is a greedy algorithm category. Set G = (V, E) is, together with the weighted graph, V = (1,2,3 ,..., n). G of the minimum spanning tree structure.
Platform: |
Size: 152576 |
Author: Katherine |
Hits:
Description: Prim算法，包括详细的容错机制，且可对非连通情况做处理。-Prim algorithm, including detailed fault-tolerant mechanism, and can be done to deal with the situation of non-connectivity.
Platform: |
Size: 1024 |
Author: 曹杨 |
Hits:
«
1
2
3
4
5
67
8
9
10
11
...
33
»