搜索资源列表
图论常用算法通用matlab程序
- 包括最短路及最小生成树算法,对于参加建模很有用的-including the most short-circuit and the minimum spanning tree algorithm, for participating in modeling very useful
jenkov-prizetags-src-2.4.1
- Tree taglib,生成树的标签库,使用比较简单。Eclipse可以直接运用。-Tree taglib, Spanning Tree for the label, the use of relatively simple. Eclipse can be used directly.
algrithm
- 算法设计与分析的经典程序,主要有0-1背包问题,最小生成树等。-algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
7_7Kruskal
- 最小生成树的经典算法——Kruskal算法。用C++实现-minimum spanning tree algorithm classic -- Kruskal algorithm. C to achieve
myprim
- 一个用Prim算法求解图的最小生成树,图是通过矩阵来建立。-an algorithm using the minimum spanning tree, the plan is to build through the matrix.
最短路径和最小生成树
- 最短路径和最小生成树-shortest path and minimum spanning tree
genBST
- 通用二叉搜索树,包含的算法有:输出广度优先遍历、前序、中序、后序遍历结果,按树的形状打印树,统计总节点数,统计叶子节点数,统计右节点数,计算树的高度,删除所有叶子节点,插入节点,查找节点,删除节点,由前序遍历结果和中序遍历结果生成树,由后序遍历结果和中序遍历结果生成树,检查该树是否平衡和完全平衡。-generic binary search tree contains the algorithm are : output breadth - first traversal, the former
des
- Prim算法完整实现代码 用Prim算法求无向图的最小生成树 -Prim algorithm to achieve a complete code with Prim algorithm try to map the minimum spanning tree
Prim算法
- 用Prim算法求最小生成树-Prim used for the minimum spanning tree algorithm