资源列表
horse
- 跳马问题，输出象棋跳马的多种的可能性结果-Horse problem, the output of a wide range of chess possibility vault results
0-1package
- 在0和1情况下进行背包问题解决，涉及多个物体的重量和价值，求得最大价值量以及分配方案。-At 0 and 1 backpack case for problem-solving, involving more than the weight of objects and values, as well as to achieve maximum value distribution program.
Rumore_rosa
- Pink noise generated in matlab
26102
- Shot 26102 I_plasma. Disruption
26001_td
- Shot 26001- I_pla - Ok Shot-Shot 26001- I_pla- Ok Shot
Rumore_bianco
- Earthquake magnitudo registered in San Francisco, during last 2 years plus white noise data
Maze
- 迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more gri
hangkong
- 航空订票系统的c++源码。是数据结构航空客运订票系统的源码，个人制造-Air booking system c++ source code. The structure of air passenger data source booking systems, personal manufacturing
d_function
- 分支限界tsp算法中求下界函数的值。有中文注释。-Tsp branch and bound algorithm for the lower bound of the value function. Chinese Notes.
DataStruct
- 数据结构实验程序 线性表 栈和队列 二叉树 图 查找 内部排序-Experimental procedures for linear data structures stack and queue table tree diagram to find the internal order
first
- 数据结构与算法分析中创建链表，实现多项式相加-Analysis of the data structure and algorithm to create a list, add up to the realization of polynomial
Huffmatreeofdatastructure
- 哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。所谓树的带权路径长度，就是树中所有的叶结点的权值乘上其到根结点的路径长度（若根结点为0层，叶结点到根结点的路径长度为叶结点的层数）。树的带权路径长度记为WPL=(W1*L1+W2*L2+W3*L3+...+Wn*Ln)，N个权值Wi(i=1,2,...n)构成一棵有N个叶结点的二叉树，相应的叶结点的路径长度为Li(i=1,2,...n)。可以证明哈夫曼树的WPL是最小的。-Huffman tree is also called the op