搜索资源列表
PRIM_MST
- 用java实现了最小求解连通图的最小生成树问题，采用的是prim算法，可供大家参考。-Using java realize the smallest connected graph for solving the minimum spanning tree problem, is the prim algorithm used for your reference.
Prim
- 用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm us
PRIM
- prim算法,解决办公室通信埋线成本计算-prim algorithm, to solve the Office of Communications embedding costing
zxprishu
- 晕个是最小生成树Prim算法，现在在建模，急用算法，希望能够能过站长的审核-Halo is Prim minimum spanning tree algorithm, is now in the modeling, emergency algorithm, hope to be able to head off the audit
matlab_tools
- MALAB程序，包括顶点覆盖近似算法,哈密尔顿回路,画等温线,模拟退火应用,生成全排列矩阵,最小生成树Prim算法,最短路径等-MALAB procedures, including vertex cover approximation algorithm, Hamilton circuit, painting isotherms, simulated annealing applications, to generate full-r
prim1
- 最小生成树 采用C程序编程实现的PRIM算法-Minimum spanning tree using C programming algorithm to achieve the PRIM
Prim
- 基于Prim算法的公路交通设计系统，开发环境VC++,简单编码，供大家参考-Prim algorithm based on the design of highway transportation system, development environment VC++, Simple encoding, for your reference
Prim
- 这是一个构造最小生成树的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 =
Prim
- Prim算法，包括详细的容错机制，且可对非连通情况做处理。-Prim algorithm, including detailed fault-tolerant mechanism, and can be done to deal with the situation of non-connectivity.
Fac4_6_2
- 最小生成树问题贪心(Prim)算法，该程序原自王晓东算法设计，程序已调通-Greedy minimum spanning tree problem (Prim) algorithm, the program Xiaodong algorithm since the original design, procedures have been transferred Qualcomm
report+of+Algorithm
- 算法设计的实验报告 包括Bottom-Up Merge Sorting算法、插入排序算法Heaps的创建堆、堆排序算法、按秩合并算法以及带路径压缩算法、实现查找第K小元素算法、实现快速排序算法、实现平面内最接近点对算法、实现最长公共子序列算法、实现矩阵链相乘算法、实现0/1背包问题算法、实现Dijistra’s算法、Prim算法、Kruskal算法、文件压缩算法-Experimental Algorithm Design Repor
PRIM
- PRIM算法 对任意给定的网和起点，用PRIM算法的基本思想求解出所有的最小生成树。-PRIM algorithm for any given network and the starting point, PRIM algorithm used to solve the basic idea of all the minimum spanning tree.
prim
- 自己编的，在VB中实现普里姆最小生成树算法的代码，有图的，边的权值是随机生成的，5个节点，点“generate tree”，就会显示出最小树。-Own, and in VB in the minimum spanning tree algorithm prim implementation code, there is graph, edge weights are randomly generated, five nodes, poi
prim
- 本源码可供数据结构的初学者借鉴，叫最小生成树prim算法-The source for the data structure from the beginners, called minimum spanning tree algorithm prim
prim
- 本程序是用来prim算法用C++的完全实现,可供大家学习使用.-This procedure is used prim algorithm using C++ implementation of the fully available for everyone to use study.
Prim
- 数据结构学习过程中的实验 PRIM算法，简单了一点，但算法是很经典的-Data structure of the experimental learning process PRIM algorithm, a bit simple, but the algorithm is a classic
prim
- prim算法构造最小生成树，调试通过，c++语言编写。-Minimum Spanning Tree Algorithm prim, debugging through, c++ languages.
shortestpath
- 这个算法通过matlab仿真得到的最小生成树Prim算法-Matlab simulation of the algorithm obtained Prim minimum spanning tree algorithm
yuandaima
- 一般背包问题的贪心算法 Dijkstra算法求解单源最短路径问题 N皇后问题 Prim算法 Kruskal算法代码-The general knapsack problem greedy algorithm Dijkstra' s algorithm for single-source shortest path algorithm N Queen' s problem Kruskal Algorithm Prim code
prim
- 对于网络，其生成树中的边也带权，将生成树各边的权值总和称为生成树的权，并将权值最小的生成树称为最小生成树（Minimun Spanning Tree），简称为MST。 Prim算法的基本思想是： (1) 在图G=(V, E) （V表示顶点 ，E表示边）中，从集合V中任取一个顶点（例如取顶点v0）放入集合 U中，这时 U={v0}，集合T(E)为空。 (2) 从v0出发寻找与U中顶点相邻（另一顶点在V中）权值最