资源列表
morphology-analysis
- 词法分析器，将我们编写的文本代码解析为一个个记号，分析得到的记号供后续语法分析使用-morphology analysis，transform text to mark,and the mark can be used for subsequent grammer analysis
ggggg
- 01背包算法的仿真与动态演示，非常好，对数据结构的理解有帮助。-01 knapsack algorithm simulation and dynamic demonstration, very good, to understand the data structure help.
calculator-2.1
- 利用堆栈实现的计算器，支持各级运算、sin、cos、阶乘、括号等。-Use the stack to achieve the calculator, support, sin, cos, operation at all levels, such as factorial brackets
hafumanshu
- 构造哈弗曼树，输出对应哈夫曼编码和平均查找长度-Huffman tree structure, the output of the corresponding Huffman coding and the average length
cengcibianli
- 运用层次遍历的方法输出从根节点到每个叶子节点的逆-The method of using traverse the level output the root to each leaf node inverse
e
- 实现二叉树的基本操作：建立、遍历、计算深度、结点数、叶子数等。-Binary tree basic operations: the establishment, traverse, calculate the depth, the number of nodes, number of leaves and the like.
b
- 实验目的：掌握用线性表实现一元多项式的基本运算。 实验内容：使用链式存储实现一元多项式的加法、减法、乘法和求导。-Purpose: to master the linear meter to achieve one yuan polynomial of basic operations. Experiment: Using the chain store to realize one yuan polynomial addition, subtraction, multiplicati
d
- 稀疏矩阵的压缩存储： 实现稀疏矩阵压缩存储，并实现矩阵转置和求和。 输入矩阵时，首先需要输入非零元素的个数，然后分别输入矩阵的 行号，列号和值。 输完2个矩阵后，自动进行计算第一个矩阵的转置以及两个矩阵的和。 例如：输入如下： 100 90 5 //矩阵的行数为100，列数为90，共5个非零元素。 1 10 100 //a(1,10)=100 50 60 200//a(50,60)=200 50 80 100//a(50,80)=10
PHD
- PHD滤波,含速度与加速度的方向，去除系统噪声协方差矩阵-PHD filtering, including speed and acceleration of the direction of removing system noise covariance matrix
BP-shenjing
- chapter3基于遗传算法的BP神经网络优化算法-chapter3 genetic algorithm BP neural network optimization algorithm based ,,,,,,,,
operationnew
- 四则混合运算表达式的处理。对输入的逆波兰表达式和正常顺序（带括号、运算符优先级）的表达式构造二叉表达式树、输出前序中序后序遍历结果、树状输出、表达式赋值及运算-Handle mixed operation expression of the four. For Reverse Polish Notation input and the normal order (with brackets, operator precedence) expression construct binary exp
complement
- 实现对整数转换为补码和补码加减运算，其中可以检查整数输入的合法性，检查补码运算是否溢出-To achieve the integer conversion to complement and complement subtraction, where you can check the legitimacy of an integer input, check whether complement arithmetic overflow