资源列表
6
- 实现二叉树的定义与基本操作，功能强大，代码清晰，并附有注释-to realize the
NQ
- N皇后问题(位运算，C语言版) N皇后问题求解 位运算-N-Queens problem (bit computing, C-language version) N-Queens problem solving-bit computing
N-Queens-problem
- N皇后问题回溯算法，算法质量高，参加ACM的同学，喜欢C算法的同学可以研究一下-N-Queens problem backtracking algorithm, the algorithm of high quality, to participate in the ACM students, students like C algorithm can be studied
Level-traversing-a-binary-tree-
- 层次遍历二叉树（顺序结构） 注意：此代码仅演示层次遍历二叉树（顺序结构），并不考虑诸多细节， 感兴趣的可自行修改-Level traversing a binary tree (order structure) Note: This code only demonstrates the level traversing a binary tree (order structure), does not take into account many details,
List
- [源码 Dev C++]单链表模板类 [节点类 链表类 遍历器类]-C++ ChainList Class
sort
- 各种排序算法,代码,大全.插入排序，希尔排序，直接排序，冒泡排序，以及各自的优化算法-Various sorting algorithm, the code, daqo. Insertion sort, hill sorting, direct sorting, bubble sort, and their respective optimization algorithm
FA
- 张林波教授关于并行优化算法，节约时间的介绍书籍-An introduction to FA
ShortestRoute
- 用vc++6.0编写的最短路径，读取数据文件，输出结果-Write with vc++ 6.0 of the shortest path, read data files and output
Evaluate
- 用栈实现表达式求解，包括栈的基本操作及运算符优先级比较，运算等。-Stack to achieve the expression evaluator, including the basic operation of the stack and the operator priority computing.
Tree
- 用队列实现带查找的平衡二叉树，有队列的基本操作及对树的平衡操作。-Queue to achieve with a balanced binary search, the basic operation of the queue and tree balancing operation.
Huffman
- 从文件中读取数据，统计各个字符情况，用赫夫曼码实现编码和译码。-Data read from the file, the statistics of each character, using the Huffman code encoding and decoding.
RLSMatrix
- 三元组表示稀疏矩阵，实现稀疏矩阵的创建、输出、转置及两个系数矩阵的乘法。-Triples representation of the sparse matrix, sparse matrix creation, output, transpose, and the two coefficient matrix multiplication.