这是一个数据结构演示系统，可以演示二叉树、二分查找等数据结构...

这个是我们大学的一个小学期作业，是完成关键路径的搜索-this is our university a primary period of operation is the completion of the Critical Path Search

用VC++与SQL实现得贸易公司管理系统-Using VC++ and SQL to achieve a trade management system

vc ADO 连接数据库-vc ADO to connect to the database

经典算法：旅行商算法，采用爬上法和分支界限搜索-classical algorithm : traveling salesman algorithm, used to climb up and branch Boundary Search

用C#语言编写的访问Access数据库的程序，主要的特点是可以在treeview上显示，并添加，删除，编辑，treeview上的节点。

这是一个用于计算最小生成树的程序。当人们逐个输入每条边的权，再点击生成，便能得到这个图的最小生成树。-This is a used to calculate the minimum spanning tree procedure. When people enter one by one each side of the right, then click generate, will be able to get this graph minimum spanning tree.

一个中国移动话费查询的例子，对初学者有帮助。-China Mobile calls an inquiry example, help for beginners.

狮身人面像单位；

算法设计与分析实验报告，内容很全面的，呵呵。-algorithm design and analysis of experiments report, very comprehensive, huh.

题目：设计一个题目，演示用算符优先法对算术表达式求值的过程。 概要设计 1、顺序扫描中缀算术表达式，当读到数字时直接将其送至输出队列中； 2、当读到运算符时，将栈中所有优先级高于或等于该运算符弹出，送至输出队列中，再将当前运算符入栈； 3、当读入左括号时，即入栈； 4、当读到右括号时，将靠近栈顶的第一个左括号上面的运算符全部一次弹出，送至输出队列中，再删除栈中的左括号。 5、使用VS栈来存储读入的操作和运算结果，然后进行数字字符到数值的转换。 -Title: Design of a topic, presentation operator priority method with arithmetic expression evaluation process. Summary of design 1, the order of scanning arithmetic infix expressions, when they read numbers directly to the output queue 2, when they read operator, it will stack all priority higher than or equal to the operator pop-up , sent to the output queue, and then the current operator入栈 3, when read left brackets, that is, when入栈 4, when they read the right brackets, it will be near the Top-left of the first operator in brackets above All a pop-up, sent to the output queue, and then delete stacks of left brackets. 5, the use of VS stack to store read operation and computing the results of numeric characters and then proceed to the numerical co