关于数据库学习的 关于数据库学习的

图的深度遍历，用二叉树实现，输入时要遵循二叉树的顶点和边数的对应关系-traverse the depth map, using binary tree realize that the importation of binary tree to be followed when the number of vertices and edges of the relationship

首先确认您的机器上已经安装了VC6.0以上版本，要编译生成可执行文件，需打开后缀名为dsw的文件，系统会默认用VC打开，然后选择Build菜单下的Set Active Configuration选项，选择Project Configuration为Win32 Release，然后编译项目，得到可执行文件。连接数据库请参照第2章的方法，在ODBC数据源内添加Microsoft Access数据库-First of all, make sure that your machine has been installed above VC6.0 to compile the executable file to generate the need to open the dsw file name suffix, the system will default to open with VC, and then select the Build menu, Set Active Configuration under the option, Project Configuration options for the Win32 Release, and then compile the project, the executable file. Connect to database please refer to the methods of Chapter 2, in the ODBC data source in Microsoft Access database to add

动态规划的石子问题算法下载压缩包后，解压，使用vc-stones dynamic programming problem packet compression algorithm download, extract, use vc

mysql数据库的软件-mysql database software

一个仿access的可用于嵌入式的数据库软件源码，可编辑生成一个小的数据库文件，这个文件可用于嵌入式系统访问。

参考课堂迷宫问题的解题方法，建立move数组，若马当前位置是（x,y）,则沿着第i(1

PB商场零售管理系统源码，无需解压密码，对需要的兄弟有所帮助-PB retail shopping center management system source code, without extracting passwords needed to help brothers

Its about the data structure Q-Its about the data structure Queue...

迷宫算法（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.

MATHEMATICA 程序 最短路径算法-MATHEMATICA procedure shortest path algorithm