资源列表
346
- 绘制表格 Kruskal算法求得的最小生成树-Drawing forms obtained Kruskal minimum spanning tree algorithm
buschoose
- 城市公交路线查询， 采用狄克斯特拉算法；可以实现查询非直达线路，专车等。里面自带3个经典皮肤-Urban public transport routes inquiries, using狄克斯特拉algorithm can query the non-direct routes, car and so on. Inside its own 3 classic skin
c++yinhangjia
- 操作系统中的银行家算法源码，用c++写的关于避免死锁的算法。-Banker s algorithm in the operating system source code, using c++ Write on the algorithm to avoid deadlock.
maxheap
- maximum heap and print
migong
- 数据结构，迷宫求解。用Visual C++编写，通过调试-Data structure, solving the maze. Using Visual C++ Prepared, through the debugging
Bittree
- 二叉树所有简单的功能，包括遍历的递归和非递归算法，值得学习研究哦！-Binary tree of all the simple features, including traversal of recursive and non-recursive algorithm, it is worth study, oh!
DFS
- DFS算法的非递归函数 老师布置的，满分作业哦！-DFS algorithm of non-recursive function teacher layout, operating out of Oh!
Prim
- 用普里姆(Prim)算法构造最小生成树,满分作业，运行无错的-With prim (Prim) Minimum Spanning Tree Algorithm, out of operation, run no wrong
TreeToBT
- 树转换为二叉树，输入为广义表格式，没有外括号，输出为转换的二叉树的中序-Tree is converted to binary tree, type generalized form, there is no outside the brackets, the output for the conversion of the tree in order
Binarytree
- 实现构造一个二叉树、二叉树的遍历（递归与非递归方法）-To achieve construct a binary tree, Binary Tree Traversal (recursive and non-recursive method)
lianbiao
- 单链表的操作，包括各种操作，如 建立链表 删除 插入 合并 -Single-chain operations, including operations, such as the creation of the deletion list Insert Merge
pack
- 一个简化的背包问题：一个背包能装总重量为 T，现有 n 个物件，其重量分别为（W1、W2、…、Wn）。问能否从这 n 个物件中挑选若干个物件放入背包中，使其总重量正好为 T ？若有解则给出全部解，否则输出无解。-A simplified knapsack problem: a backpack can hold a total weight for the T, the existing n-object, its weight, respectively (W1, W2, ..., Wn).