搜索资源列表
普利姆最小生成树
- 用普利姆算法实现最小生成树，简单的排序算法。对学习很有帮助-with minimum spanning tree algorithm, a simple algorithm. The study helpful
greedy_three
- 用贪心算法求最小生成树的问题是可以由这个程序来实现的。它求出在一棵树中哪些边组成的通路具有最小的权值。-with greedy algorithm for the minimum spanning tree problem can be resolved by this procedure to achieve it. It obtained in a tree in which the edge of the pathway with minimum weight.
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,
tree
- 最小生成树 算法 利用二叉树原理生成最小生成书 数据结构实验-Principle of minimum spanning tree algorithm uses a binary tree data structure generated experimental Smallest Book
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
Shortest
- 数据结构实验内容 最小生成树程序设计-Minimum spanning tree
1
- 最小生成树问题用于求解离散数学最小生成树-Minimum spanning tree of the minimum spanning tree problem for solving the discrete mathematics
MinTree
- 连通图的最小生成树过程的图形动态演示。可以手动输入图，也可以自动生成图。-The minimum spanning tree of a connected graph process dynamic graphical presentation. Can manually enter, can also be generated automatically FIG.
PrefixFreeTree
- 这是一个用c++写的计算最小代价生成树的程序-This is a c++ to write a program to calculate the minimum cost spanning tree
zuixiaoshengchengshu
- 按普里姆算法或克鲁斯卡尔算法求最小生成树。输出生成树的边集、路程和总路程。 -Minimum Spanning Tree