资源列表
Knight
- 经典的骑士巡游问题，通过走日子来遍历棋盘，非回溯法，可以有效率的解决8*8棋盘的解决方案，但是不能保证所有问题都是有解的-Classic knight' s tour problem, by taking a day to traverse the board, non-backtracking, can be effective solution 8* 8 board solution, but can not guarantee that all problems are solvab
frog
- 青蛙换位问题，左边的青蛙和右边的青蛙要面对面跳跃，墩子数比青蛙数多1，左边右边交换位置了代表成功-Frog problem of transposition, the frog on the left and right sides of the frog to jump face to face baidunzi than frog a few more than a left right swap positions on behalf of successful
lessnumberfirst
- 八数码难题的第二种解法，仍然用分支限界法，但是选择的优先策略变成了不在目标位置上的数最少的优先的方法-The second solution of eight digital problems are still using the branch and bound, but to select the priority strategy into a not in the target location on the least number of priority
eightnumber
- 八数码难题，又称九宫格问题，也是我们平时玩的华容道，用分支限界法解决该问题-Eight digital problem, also known as the squared problem, we usually play Huarong, branch and bound method to solve the problem
1
- 数据结构相关：排序、堆栈、队列、数据库相关程序实例-Sorting, stacks, queues, database instance
Exp4_Huffman
- 算法设计与分析中的哈夫曼算法，C++源程序-Algorithm design and analysis of the Huffman algorithm, C++ source
StringMatch
- 算法设计与分析中的字符串匹配算法，C++代码-String matching algorithm, algorithm design and analysis courses, C++ code
Graph-DFS-BFS
- graph traversal using bfs and dfs strategy
BT-Traversal
- this sample implementation of binary tree traversals-this is sample implementation of binary tree traversals
AVL-Tree
- a sample implementation of AVL tree using c-a sample implementation of AVL tree using c++
DeQ-using-STL
- this is sample dqueue implementation using STL
Vector-quantization
- 矢量量化在C语言下的实现，在VC6.0下编译通过-Vector quantization in C voice implementation, compiled by VC6.0