资源列表
matrix_mult
- 矩阵链的相乘的源代码，采用动态归还算法求解得到最优解。-chain matrix multiplication of the source code, the return of dynamic algorithm to obtain the optimal solution.
ordering5
- 基数排序：思想:先从数据的低位开始,进行分配,分成10个空间,分别存储位为,0,1,2,3...9 重复的对次地位操作,知道预定的高位,排序完成
erchashuzuichanglujing
- 本程序实现求二叉树的最长路径，输出该二叉树的最长路径数目以及该路径上的各节点-Binary tree for the program the longest path, the output of the binary tree the number of the longest path and the path of each node
knapsack
- 背包问题，每类物品个数不限，使得总价值最大的动态规划算法。-Knapsack problem, the number of each type of goods not limited to, making the total value of the largest dynamic programming algorithm.
JosephusProblem
- 这是约瑟夫问题,用循环链表实现的,其代码用头文件写出-This is Joseph problems linked with the implementation cycle, the code is written with the header file
1222
- 北大在线做题系统1222 模拟题 源自点灯游戏
MaximumMatchingonGeneralGraph
- 一般图最大基数匹配的带花树模板,已成功通过URAL10
tanxin
- 在对问题求解时，总是做出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，他所做出的仅是在某种意义上的局部最优解。-In problem solving always made in the current appears to be the best option. In other words, do not be optimal from an overall consideration, made by him are in a sense only the local opti
Algo2-5
- 数据结构练习编程第1-1程序代码，经调试可以运行，很大很复杂-Data structure the first 2-5 exercise programming code, you can run through the debugger, a large complex
HuffmanCPP
- 自己按照算法写的代码，请大家多多指点指点，看看有什么需要改进的-Themselves in accordance with the algorithm to write the code, please a lot of pointers pointing to see what needs improvement
3-1
- 广义表的建立和判断两广义表是否相等，数据结构作业-To establish and determine the general form of the two is equal to the generalized form, the data structure operations
Transpose
- 利用C++对一个任意的矩阵进行转置运算，即元素的位置交换-Using C++ for an arbitrary matrix transpose operation