搜索资源列表
src
- 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, colle
prim1
- 最小生成树 采用C程序编程实现的PRIM算法-Minimum spanning tree using C programming algorithm to achieve the PRIM
prim
- 二叉树中的prim最小生成树算法。编译环境：vistual stdio 2008-Binary tree in the minimum spanning tree algorithm prim. Compiler environment: vistual stdio 2008
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 = (1,2,3 ,..., n). G of the min
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 Report including Bottom-Up Merge So
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
- 求素数的源代码，用c语言写的，代码中算法要求较高-how to find the prim number
Prim
- Prim最小生成树 Prim最小生成树-PrimPrimPrimPrimPrimPrimPrimPrimPrimPrimPrimPrim
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 to achieve the prim tree, friends who are interested can look at.
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.
prim
- 普里姆算法，求图的最小生成树问题。用的是C语言，比书上的详细。-Prim algorithm, and the minimum spanning tree problem Fig. Using the C language, the detailed than the book.
shortestpath
- 这个算法通过matlab仿真得到的最小生成树Prim算法-Matlab simulation of the algorithm obtained Prim minimum spanning tree algorithm
mintreePrim
- Dandn文件给出了输入参数的名称及格式 即在调用prim前先输入邻接矩阵D和节点个数n 输入prim 得到两行的矩阵T,将上下两行数字对应的节点相连即可-Dandn document gives the name of the input parameters and format Prim in the call prior to the importation of adjacency matrix D and the node number n Input pri
prim
- 对于网络，其生成树中的边也带权，将生成树各边的权值总和称为生成树的权，并将权值最小的生成树称为最小生成树（Minimun Spanning Tree），简称为MST。 Prim算法的基本思想是： (1) 在图G=(V, E) （V表示顶点 ，E表示边）中，从集合V中任取一个顶点（例如取顶点v0）放入集合 U中，这时 U={v0}，集合T(E)为空。 (2) 从v0出发寻找与U中顶点相邻（另一顶点在V中）权值最小的边的另一顶点v1，并使v1加入U。即U={v0,v1 }
GraphTheory
- 自己写的图论的一些基本算法，有找关键路径，最短生成树，Prim算法-On their own plans to write some of the basic algorithm, there is to find the critical path, minimum spanning tree, Prim algorithm, etc.