学生课程管理系统,一个学习数据结构过程中的必备程序。

有关java的一个简单树，显示树结构，程序很简单。-the java a simple tree, the tree structure, procedure is very simple.

首先确认您的机器上已经安装了VC6.0以上版本，要编译生成可执行文件，需打开后缀名为dsw的文件，系统会默认用VC打开，然后选择Build菜单下的Set Active Configuration选项，选择Project Configuration为Win32 Release，然后编译项目，得到可执行文件。连接数据库请参照第2章的方法，在ODBC数据源内添加Microsoft Access数据库train.mdb，并将数据源名设定为train即可实现数据库和应用程序的正常连接，程序才能正常实现数据库的访问。另外，如果用户自己编写了.chm的帮助文档只要和可执行文件放在同一个目录下就可以了。 用户要修改程序源码可以选择相应的.h和.cpp文件，本实例使用的命名规则基本是：DIALOG_***** 为管理对话框资源， *****Info为数据输入窗口资源， *****Set为结果集对应的类 -first confirmed your machine has been installed on VC6.0 versions, to build generating executable files, Suffix required to open the document called DSW, the system will default VC opened, then select Build menu under Set Active Configuration options Project Configuration options for Win32 Release. then compile the project, to be executable. Connecting to the database please refer to Chapter 2, the ODBC data source adds Microsoft Access database train.mdb. from the data source can be set to train database, and application of the normal connections, normal procedures can achieve database. In

由于简单模式匹配算法在一次字符比较失败后，简单的把模式串位置向前移动一个字符位置，这样就丢掉了前面字符匹配中得到的信息，效率差。所以就需要一种无回溯的算法来提高效率，这里使用KMP（Knuth-Morris-Pratt）算法。模式串前面的连续片断部分称“前缀模式”，前缀模式在模式串后部重复出现的情况可以用来避免重复进行已经做过的检查，这是KMP算法中的一个重要概念。-as simple pattern-matching algorithm to compare a character failure, a simple model put forward position Series mobile location of a character, would be lost in front of characters matching the information inefficiently. There is a need for a non-backtracking algorithms to improve efficiency, the use of KMP here (Knuth-Morris-Pratt) algorithm. Model Series in front of a row clips part said "prefix model," prefix string pattern in the pattern of recurring back can be used to avoid duplication of inspection has been done, KMP algorithm is an important concept.

本人的ssd7的练习3的答案， 供大家参考， 希望大家喜欢-ssd7 exercise3

将数据库输出到一个文本文件中-database output to a text file

实现最短路径算法。 实现最短路径算法。-Realize the shortest path algorithm. Realize the shortest path algorithm.

KMP算法是一个查找两个字符串公共串的算法,比一般的算法效率要高很多.-KMP algorithm is a two string public string search algorithms, than the average efficiency of the algorithm is much higher.

超市进销存管理系统源码，采用的是Visual Basic 语言和ACCESS数据库的综合-Purchase, Sales and Inventory management system stores source code, are used in Visual Basic language and ACCESS Database General

Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part.

此代码是一个数据结构课程设计――飞机订票系统.-this code is a data structure course design-- aircraft booking system.