本系统为餐饮管理系统，为现代餐饮业管理更便捷化，节约时间...

1. 仍然使用MyDatabase数据库，用SYSDBA用户登录。 2. 在ISQL中，依次输入第4章的数据表创建SQL语句；或者根据表4-1至4-8自行创建数据表。（可以直接使用光盘提供的MyDatabase.GDB数据库。） 3. 使用MyDB数据库连接，在SQL Explorer中输入原始数据。除了表4-9和表4-10的内容，还需要在USER_PASS表中设置一个权限为’3’的JWC用户名，用于课程的调度；设置若干个教师的账号（需要在TEACHER数据表中设置相应信息），权限为’2’；若干学生的账号。 4. 修改源代码中数据库连接组件Database的参数，包括服务器地址、登录用户名和默认密码。 -1. Still used MyDatabase database, with SYSDBA user login. 2. In ISQL, followed importation of Chapter 4 of the data table creation SQL; Or, according to Table 4-1 4-8 to set up a data table. (CD can be used directly for the MyDatabase.GDB database.) 3. Use a few MyDB According to the Link, SQL Explorer in the original input data. In addition to Table 4-9 and table of contents 4-10. USER_PASS also need a table set up the authority of the"3 "JWC user name, for course scheduling; Several teachers set up the account (in TEACHER data tables set up corresponding information), the authority of"2 "; Several student"s account. 4. Modifying the source code, database

是一个用于管理公司avous we make Purchase of good sales order quote proforma模块的应用程序；

三个求二分图最大匹配的程序（bfs，dfs，多增光路算法）-Three for the maximum bipartite graph matching procedure (bfs, dfs, multi-path algorithm Zengguang)

这是一个改进了自顶向下的归并排序，它改进的地方主要有：采用小子文件截止的机制，当序列长度小于32时，采用直接插入排序；对归并的内循环作了优化，判断的次数更少。-This is an improvement from a top-down sort of merger, it improved the main : the deadline for the paper boy mechanism, the length of the sequence is less than 32, the use of direct insertion sorting; Merging with the right circle made optimization, the number of less judgment.

任意的表达式求解！ 包括函数。-arbitrary formula to solve! Including function.

JMessage Board System-JMessage Board System...

自己写的四皇后问题的算法，其中的注释非常的详细，请多指教-himself wrote four of the Queen"s algorithm, which is very detailed notes, please enlighten

数据结构1800例题与答案 我想对大学生很有用啊-data structure with 1,800 examples, I would like to answer students useful ah

数据结构 课程设计 迷宫问题 欢迎下载-Data structure the curriculum design issues welcome maze download

该程序完成对二叉树的非递归的前序遍历，在三种遍历方法中，这种遍历最简单，所以，核心代码自然要少很多。-completion of the process of non- recursive binary tree of the former preorder, the three traverse method, which traverse the most simple, so natural to the core code is much less.