用C++Builder写的数据结构队列问题的程序。希望对大家有用。

结构分析程序2，用fortran90编写，主要用于结构分析-two structural analysis procedures used to prepare FORTRAN90, mainly for structural analysis

如果要连接的数据库文件和当前文件在同一个目录下-If you want to connect to the database file and the current document in the same directory

这是用java实现的一个人员管理系统的例子，可以实现人员管理-This is a java implementation of the personnel management system, examples of personnel management can be achieved

本人的练习2的答案， 供大家参考， 希望大家喜欢-ssd7exercise2

户籍管理系统--毕业设计-household registration management system-- Graduation

大学毕业的课题,可能比较简单一点,入门的人可以-University graduate topics that may be relatively simple, entry can

数据结构中迷宫问题的求解，迷宫问题.vcproj 这是使用应用程序向导生成的 VC++ 项目的主项目文件。 它包含生成该文件的 Visual C++ 的版本信息，以及有关使用应用程序向导选择的平台、配置和项目功能的信息。 迷宫问题.cpp 这是主应用程序源文件。 StdAfx.h, StdAfx.cpp 这些文件用于生成名为 迷宫问题.pch 的预编译头 (PCH) 文件和名为 StdAfx.obj 的预编译类型文件。 -Data structure to solve the problem in the maze, the maze problem. Vcproj This is using an application wizard to generate the VC++ project the main project document. It contains the document to generate Visual C++ version information, as well as applications relating to the use of the wizard select the platform, configuration and project features. Maze problem. Cpp This is the main application source file. StdAfx.h, StdAfx.cpp these files used to generate a maze called the question. Pch precompiled header (PCH) files and named StdAfx.obj type of pre-compiled files.

用VB和matlab混合编程，编写的数据库，数据库包含有删除，添加，修改，插入 及查看等功能，在利用VB和SQL联系起来，由于matlab强大的算法功能，将输入各类数据进行用算后存入数据库。

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.

快速排序算法代码Quick sort algorithm code-Quick sort algorithm code