资源列表
union_find
- Fastes Union find algorithm
1132154564787
- 这是一个链栈，用户可以根据提示进行栈的入栈、出栈等基本操作。-This is a chain of stack, the user can be prompted to stack the stack, the stack and other basic operations.
beipaowenti
- 背包算法的c++简单实现，很有用的，可以-Knapsack algorithm
Two-forks-the-tree
- 二叉树的左右子树的遍历，以及树的深度的算法-Left and right subtree of the binary tree traversal and depth of the tree algorithm
quicksort
- 《算法导论》第三版中快速排序伪码的C语言实现-"Introduction to Algorithms" the third edition of Quick Sort pseudo-code in C language
Graph
- 采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。
queen
- C++语言编写的马的遍历的实现方法，请多多指教
erchashu.txt.tar
- 实现二叉树链表表示的二叉树： 建立一棵二叉树； 按先序、中序和后序遍历二叉树； 按层次遍历； 求一棵二叉树的高度； 交换一棵二叉树的左右子树； 复制一棵二叉树。-Realize that the binary tree binary tree list: building a binary tree by the first order, in sequence, and after traversing a binary tree by level tr
Kruskal
- 主要功能： Kruskal算法实现最小生成树-Main features: Kruskal minimal spanning tree algorithm
migong
- 通过运用栈实现迷宫问题，探索一条道路并打印出路径-Achieved through the use of a stack maze problems, explore and print out the path of a road
Knapsack01
- 0/1 knapsack source code
a
- 创建两个顺序表,并用快速 排序进行排序,最后将两个顺序表合并到一个新的顺序表并进行排序 -Create two order list, with quick sorting sorted and will last two sequential list merged into a new order form and sorting