资源列表
fengsuyun
- 本程序主要是用于编译原理中的语法分析用的是vc++语言，用的是LR1语法分析法。-this procedure is used mainly to the principle of compiler syntax analysis is vc language, the syntax is Sequence Analysis.
实用算法的分析与程序设计
- 本书总结了历届国际奥林匹克竞赛（IOI）的试题特点及我国参赛选手的培训经验。书中许多例题取自历届大赛的试题及中国队选手的训练题目，针对问题讲解了解题的关键思路及如何灵活运用有关的算法知识。-the book summarizes the successive international Olympiad (IOI) and the characteristics of the questions my players training experience. Many examples from
线性表元素删除
- 线性表元素删除运算,删除线性表L中第i个位置上的元素-linear elements to delete Table Operational delete Table L linear section i positions on the elements
叶子结点统计
- 递归算法求统计二叉树T中叶子结点的数目，数据结构常用算法-recursive algorithm for statistical binary tree T leaf node of the number of commonly used data structures Algorithm
sy3-ex
- 算符有限分析法 //程序功能： //根据算符优先分析法，将表达式进行语法分析，判断一个表达式是否正确。 //文法：E→E+E E-E E*E E/E (E) i // 其中i为无符号整数-operator limited analysis / / procedural functions : / / operator under priority analysis, to conduct regular expression syntax analysis, judgment, an expr
EXP6
- 数据结构典型算法实现，c实现二叉树的遍历以及赫夫曼编码-data structure typical algorithm, c achieve the traversal of a binary tree Huffman coding
exp5
- 数据结构算法，稀疏矩阵的存储，两矩阵相乘，两矩阵相加的实现-data structure algorithms, sparse matrix storage, two matrix multiplication, the sum of two matrix to achieve
导游系统
- c++实现的程序，真正实现查询，最短路径-c achieve the procedure, the actual realization of inquiries, the shortest path
Bellman-Ford算法
- Bellman-Ford算法 是最短路径算法的一种-Bellman-Ford algorithm is the shortest path algorithm of a
模板类栈求表达式值
- 是一个表达式求值的算法，用 模板实现的，可以进行四则运算，支持小数和括号-is an expression evaluates the algorithm, using the template, can be four operators, and parentheses minority support
dcce1
- 使用tc2的adaptive huffman编码，并附带图形界面-use of adaptive vs. Huffman coding, and incidental graphical interface
sinx
- 一个计算SIN X的函数,觉得算法还可以-a calculation SIN X function, algorithm can also think! !