资源列表
Text3
- 要求：设计要求对输入的一串电文字符实现哈夫曼编码，再对哈夫曼编码生成的代码进行译码，输出电文字符． 内容：1 哈夫曼树的建立 2 哈服满编码的生成 3 编码文件的译码-Requirements: design requirements for the realization of the input character string message Huffman encoding, and then generate the code for Huffman de
Exp4_Huffman
- 算法设计与分析中的哈夫曼算法，C++源程序-Algorithm design and analysis of the Huffman algorithm, C++ source
analytic-hierarchy-process
- matlab编写的层次结构算法，将一个复杂矩阵分解为多个准则，得到多指标的若干层次，通过定性指标模糊量化方法算出单排序（权数）和总排序。-hierarchy algorithm, Matlab written in a complex matrix is decomposed into a number of criteria, multiple indicators at several levels to calculate the single-sort (we
danlianbiao
- 数据结构中有关于单链表的生成、节点的删除、读取等操作-Data structure has generated on a single list, delete nodes, read other operations
中缀表达式求值
- 中缀表达式求值,运用了堆栈进行存储,并支持小数的计算-expression which evaluates superintendent, the use of stack for storage, and support for the calculation of the minority
数据结构 顺序表
- 顺序表的有关操作
Cpp1
- 求强连通分量，好像只是判断有几个强连通分量的。-Strongly connected component, it seems only a judge has several strongly connected components.
01pack
- 01背包问题,用动态规划实现的,里面讲得很详细-01 knapsack problem, using dynamic programming to achieve, which made detailed
sorting
- Program that demonstartes external sorting
erchashu.cpp
- 二叉树的插入、删除、哈夫曼树的一些基础等内容哟。-Binary tree insertion, deletion, such as Huffman tree based on the content of some of yo.
bianli
- 本程序用c语言编写，是实现数的遍历。 可参考使用、学习-This procedure with c language, is to achieve the number of traversal. Can be used for reference, study
node
- 判断链表里面是否存在节点,插入位置是否超出链表当前最大位置的范围,获取当前位置的前一个节点,将要节点插入要插入的位置,删除节点-List to determine whether there is inside the node, to determine whether the insertion position of the maximum position beyond the scope of the current list, the current location of the