这是继一之后的第2个管理信息系统的案例 很不错的 大家来看看吧...

c++实现的程序，真正实现查询，最短路径-c achieve the procedure, the actual realization of inquiries, the shortest path

分支限界tsp算法中求下界函数的值。有中文注释。-Tsp branch and bound algorithm for the lower bound of the value function. Chinese Notes.

PB9.0生成的学生信息管理系统，能完成学生信息的增加，删除，修改等基本操作。后缀为db的是数据库文件-PB9.0 generated student information management system, to complete the student information to add, delete, modify the basic operation. Db suffix to the database file

完成实验要求的全部功能并运行通过，算法有一定的新意，程序代码符合书写规范，实验报告叙述清晰完整，有详尽的分析和总结-completion of the pilot all the functional requirements and run through the algorithm of a certain novelty, with code written norms, experimental report describes a distinct and comprehensive, detailed analysis and summary

SQLSERVER源代码-SQLSERVER source code

同样具 体引退台与与与土他 与体引退台与与与同同样具体引退台与与与土他与土他与 土他与 -same with the same specific retire with Taiwan and with the soil and soil his body and he retire with Taiwan and the same with concrete and retire with Taiwan and with the soil and soil samples with specific units and retire with his Turkish soil with soil with soil and he

最简单和最酷的方式来创建类似程序，可以做与 ListView 保存、 加载和修改多个条目与文本的文件的数据库。必须下载此，请参阅如何最简单的这种方法是

删除ORACLE数据库记录，条件选择，多表选择，删除结果显示，显示删除表数据的条码，对应每一个表多少记录，数据库多表可选择删除，结果多条显示

单比特树查找算法，是用于路由查找的，内含有路由查找相关资料-Monobit tree-search algorithm is used to identify the routing, which contain routing information Search

不带头结点的链式堆栈类,1、 定义并实现不带头结点的链式堆栈类，除构造和析构函数外，成员函数还有入栈、出栈、取栈顶元素、判断堆栈是否非空，头文件为“nohead_LinStack.h”。-node does not take the lead in the category of chain stack, 1, and the definition does not take the lead in realizing the chain nodes stack category, In addition to construction and destructor function, the members also function stack, stack up and stack elements for judging whether non-empty stack, The first document as "nohead_LinStack.h."