搜索资源列表
the_tree
- matlab实现的最小生成树的两种最基本的算法即Kruskal，Prim。-matlab realization of the minimum spanning tree algorithm that is, the two most basic Kruskal, Prim.
prim
- prim求最小生成树，求最短路径，并求出权值-prim for minimum spanning tree, and the shortest path and find the right value
PRIM
- 构造最小生成树的常用方法是Prim算法与Kruskal算法，二者都是基于贪心算法设计侧略。-Construction of the commonly used minimum spanning tree algorithm is Prim and Kruskal algorithms, both are based on the design side of a little greedy algorithm.
Prim
- 用普里姆（Prim)算法求用邻接矩阵存储结构表示的图或网的最小生成树-With the prim algorithm is seeking to use adjacency matrix storage structure, said the plan or network, minimum spanning tree
Prim
- Prim算法（节点可任意选定） Prim算法（节点可任意选定）-prim algorithm
Prims_Algorithm
- Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total
PRIM
- prim s algorithm implementation in C++ with graphical output
prim
- 依据prim最小生成树的算法实现的最小生成树源码，能够建立准确的最小代价生成树-Prim minimum spanning tree based on the minimum spanning tree algorithm source code, be able to establish an accurate minimum cost spanning tree
prim
- Prim算法用于求无向图的最小生成树. -Prim algorithm is used to seek an undirected graph of the minimum spanning tree
spanning_tree
- 最小生成树的多种形式。Kruskal邻接表，正向表，prim+binary_heap邻接表正向表，prim+mapped_heap邻接表正向表.-Minimum spanning tree in many forms. Kruskal adjacency list, forward the table, prim+ binary_heap forward adjacency list table, prim+ mapped_heap f
Prim
- 应用Prim算法构造最小生成树，是数据结构的节本算法-Application of Prim minimum spanning tree algorithm is constructed, the data section of the structure of the algorithm
prim
- Prim’s Minimum Spanning Tree Algorithm
prim
- 介绍了有关最小生成树prim的生成途径以及程序具体设计-Describes the generation of the minimum spanning tree prim specific design of channels and programs
PrimKruskal
- prim kruskal source code
Primukas.java.tar
- In computer science, Prim s algorithm is an algorithm that finds a minimum spanning tree for a connected weighted undirected graph.
graphic_alogrithms_collection
- 图论flord算法、哈密顿通路算法、kruskal算法、最大流算法、prim算法、旅行商算法及路由算法等等，都是由Matlab编写的图论算法程序。-Many graphic alogrithms are collected here. They includes flord, hamiltonian path, kruskal, max flow, prim, traveling salesman problem, and routin
prim
- c语言实现的Prim算法，用来求无向图的最小生成树-failed to translate
prim
- C++，用PRIM算法求最小生成树，能输入顶点和边,计算最小生成树-C++, with the PRIM for the Minimum Spanning Tree, can enter the vertex and edge to calculate the minimum spanning tree
Prim.c.tar
- prim 最短路径实现 C++ 描述～代码规范，适合初学者-prim shortest path to achieve C++ descr iption ~ code specifications, suitable for beginners
PRIM
- prim算法 ，输入一个图，然后 求它的最小生成树 -prim algorithm, input a graph, and then seek its minimum spanning tree