资源列表
huffman
- 霍夫曼编码，基于最优二叉树的编码方法。该方法完全依据字符出现概率来构造平均长 度最短的码字。-Huffman encoding, the encoding method based on optimal binary tree. This method is entirely based on the probabilities to construct the character length of the shortest average code word.
Hanmin
- 汉明码，一个错误校验码码集。与其他的错误校验码类似，汉明码也利用了奇偶校验位的概念，通过在数据位后面增加一些比特，可以验证数据的有效性。利用一个以上的校验位，汉明码不仅可以验证数据是否有效，还能在数据出错的情况下指明错误位置。 -Hamming code, a checksum error code set. And other similar error checking code, Hamming code also makes use of the concept of parity, d
Binary-tree
- 建立二叉树存储结构,求二叉树的前序中序后序遍历,以及求指定节点的路径-The establishment of binary storage structure, seeking pre-order binary tree traversal in order after the order, and find the path specified node
expression
- C编写的利用栈实现表达式计算。其中记录入栈出栈的次数。-Written in C using the stack to achieve expression evaluation. Which records the number of stack stack.
BExpression
- C编写表达式计算。利用二叉树实现。数据结构的大作业。可以与栈实现进行比较。-Written in C expression evaluation. The use of binary tree implementation. Data structure of the major operations. Compared with the stack can be achieved.
sort
- 数据结构课程设计（各种内排序的实现及用时比较）-Data Structure Course Design (sort of inside and use the time to achieve more)
migong---cPP
- 迷宫问题C++代码。。。解决迷宫问题-Maze C++ code. . . Solve maze problems. . . .
AVL
- 利用平衡二叉树实现一个动态查找表， 以二叉链表作为二叉树的储存结构-Achieve a balanced binary tree using dynamic lookup table to binary linked list storage structure as a binary tree
Traffic-Advisory-Simulation
- 模拟全国交通查询，可实现最少时间路径查询、最少中转路径查询、最省钱路径查询，基于图算法实现。-Simulated the nation' s transportation inquiries, to achieve the minimum time path query, at least transit path query, the most economical path query, graph-based algorithm.
0521513383
- book on algorithm analysis. filetype:pdf
PolynomialCoeff
- NTL应用——大数系数多项式乘法的计算。从文件读如参数，计算多项式相乘后某项的系数-NTL application- the multiplication of big numbers coefficient polynomial
concurrent-data-structures.pdf.tar
- Concurrent data structures.