资源列表
LSshixian
- 顺序表类型的实现,数据结构清华大学严老师C语言第二版算法。-order to achieve the type of data structure Tsinghua University teachers strict version of the second C-language algorithm.
VCsort
- 经典VC排序源代码，做成了win32界面形式,希望对大家用所帮助-classic VC ranking source code resulted in the win32 interface form, and I hope to use all the help
gtrtgdfg
- 遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化. -traverse binary tree is frequently encountered in a operation. Binary Tree ca
01package
- 背包问题优先队列分枝限界算法 所谓的背包问题，可以描述如下：一个小偷打劫一个保险箱，发现柜子里有N类不同大小与价值的物品，但小偷只有一个容积为M的背包来装东西，背包问题就是要找出一个小偷选择所偷物品的组合，以使偷走的物品总价值最大。这个问题的求解有很多种方法，本程序使用分枝限界法求解。-knapsack problem Branch and Bound priority queue algorithm called knapsack problem can be described as f
MaxClique
- 回朔法解决最大团问题:G的最大团是指G中所含顶点数最多的团-back Schomburg France's largest corporations to solve the problem : G the largest group G is contained in a maximum number of vertices the league
n-Queen
- 算法设计:著名的n后问题:在nXn的棋盘上放彼此不受攻击的n个皇后,按国际象棋的规则,任何2个皇后不在同一行或同一列或同一斜线上. 本算法才用回朔法来解决.-algorithm design : n after the famous question : In nXn put on the chessboard of each other against attack n empress, according to the international rules of chess, any
Beautifulprint
- 该程序用Java实现了算法中的动态规划问题_漂亮打印-the program using Java to achieve a dynamic algorithm planning _ pretty Print
sujujiegou
- 数据结构的一些常用算法实现。单链表。无向图排序等-data structure of some commonly used algorithm. Single-Chain. No plans to sort etc.
bigNumberMult
- 大数相乘算法,使用C++语言在VC下实现.-large numbers multiply algorithm, the use of C language in the VC achieve.
dsjc
- 大数相乘的源代码,使用C++在VC环境中实现.-multiply large numbers of the source code, the use of C in the VC environment to achieve.
lgh2.5
- 算术表达式求值演示系统－－数据结构作业！-arithmetic expression evaluates demonstration system -- operational data structure!
tubaoTest
- 凸包算法的实现，用的控制台程序，不过已经能够说明问题了-convex hull algorithm for the realization of the console procedures, but has been able to illustrate the problem