搜索资源列表
GraphVc7
- 先输入图的各顶点名，再输入图的邻接矩阵从而建立图，并用笛施卡尔，普里姆等三种方法求其最小生成树，-input vertices of the plan, and plans to import the adjacency matrix thereby establishing map, and use flute Shi Carl prim other three methods for the minimum spanning tree,
prim
- 数据结构课程设计，prim算法求最小生成树，给出了所有可能的生成树-Data structure course design, prim algorithm for minimum spanning tree, has given all the possible spanning tree
minimum
- minimum spanning tree problem, kruskal and prim algorithms.Program gets matrix as an input
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
juzhen
- 数据结构中关于图的应用，涉及到遍历，查询，Ｐｒｉｍ算法等-Data structure on the Charts, involves traversal, query, Prim algorithm
prim
- 普里姆算法的C++代码实现，有很详细的注释，代码很清晰-Primm algorithm C++ code implementation, there is a very detailed notes, the code is very clear
PrimAdjLinkList
- 这可以作为头文件；图结构中，基于邻接链表的prim算法-Graph, adjacency list based on prim algorithm