Prepared using the VC Joseph Central program, simple and clear, easy to use

数据结构链表-多项式-data structure Chain-polynomial

JAVA源代码反编译超级引挚 -Java source code compiler- super engine

开括号和比括号的匹配，数据结构内容，很不错-More than brackets and brackets to open the match, the contents of data structure

ＰＯＪ　１１２５己ＡＣ源代码，不信你可以试试．-POJ 1125 F AC source code, do not believe you can try.

VB做的电话号码查询程序-VB done for the telephone number of procedures

minilist类的实现。数据结构的作业之一，用c++实现minilist类，已经通过测试。-minilist class implementation. One of the data structures, using c++ implementation minilist classes have been tested.

数据库编程 DAO连接数据库-DAO Database Programming connect to the database

本书是关于计算机科学与工程领域的基础性研究科目之一――数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。 本书内容广博权威，结构清晰合理，是一本全新的有关数据结构与算法的教材，对于计算机科学与工程领域的从业人员也是一本很好的参考书。-the book is on the computer science and engineering fields, the basis for one of the subjects of study-- data structure and algorithm monographs. The book in a brief review of the basic design concept C program on the basis of a comprehensive and systematic introduction of the queue, stack, trees and map basic data structure and the greedy algorithm, divide and conquer algorithm, branch-and-bound algorithm multiple algorithm design methods, data structures and algorithms for continuous learning Research and lay a solid foundation. Even more valuable is that the book not only on the theoretical knowledge but also provided more than 50 application examples and more than 600 Exercises Road. The contents broad authority, a clear and reasona

本程序所有数据库文件都以.sql文件保存在Database文件夹里； 2、首先在SQL查询分析器中运行CreateDatabase.sql文件创建数据库； 3、运行其他所有的.sql文件即可创建好了本程序的数据库；-documents to the database. Sql file stored in Database folder; 2, the first in SQL Query Analyzer run CreateDatabase.sql database file creation; 3, running all the other. Sql documents can establish a better process of the database;

此函数功能是图的遍历算法，用邻接矩阵存储图，然后求出其拓扑排序，再输出其图的信息-Function is to map the function of the traversal algorithm, the adjacency matrix storage map, then calculated the topological sort, then the output of its map information