经典迷宫问题求解

BabelKit是一个通用多语言数据库代码表的接口。它接收维护使用多语言的多个数据库代码定义集中的所有编程工作。代码管理和翻译页可以让开发人员定义新的虚拟代码表，新语言，输入所有代码和它的描述，再将它们翻译成所有相关的语言。Perl和PHP类可以检索代码描述，并自动地用用户语言生成HTML代码选择元素。这简化了Web站点及数据库的国际化和本地化。 -BabelKit is an general multi- languages databases code page connection. It receives the maintenance to use the multi- languages many databases code to define the centralized all programming work. The code management and the translation page may let the development personnel define the new hypothesized code page, the new language, input all codes and its description, translate again them all correlations the language. Perl and the PHP kind may retrieve the code description, and automatically produces the HTML code choice element with the user language. This simplified the Web stand and the database internationalization and the localization.

回溯算法迷宫问题-VB代码是回溯算法非常经典的例子。可以做游戏做简单的参考

N皇后的排列树与子集数算法！里面是Cpp的源代码 带注释-N Queen subset of the arrangement of trees and the number of algorithms!

这里面有二分查找、进制转换、数据结构、货郎担算法、动态网络最短路线等等很多很多的程序-There are binary search, binary conversion, data structure, traveling salesman algorithm, dynamic shortest route network and so on many, many procedures

无限位的大数加减运算，纠错能力很强，界面间接-unlimited majority of the modified bit computing, a strong correction capabilities, interface indirectly

如何备份和还原 MYSQL 数据基地 PROGRAMATICALY 与 VB 6.0 使用 MYSQL 转储程序来备份和还原到 MYSQL.exe。

求解线索二叉树中结点前趋和后继的算法以及以相应次序遍历线索二叉树的算法，二叉树的线索化算法的设计-Solving clues to binary tree node before the trend and follow-up algorithm and the corresponding sequence of binary tree traversal algorithm clues, clues to binary tree algorithm design

使用动态规划的方法求接出怎样在两条装配线上以最快的时间完成装配任务-The use of dynamic programming methods for how to access the assembly line in the two shortest time to complete the assembly task

这是一个有关数据结构的习题集，里面包含了有关数据结构各个章节的习题以及答案，可以方便同学们下载使用。-This is a set of exercises on data structure, which contains information about data structures, as well as answers to the various chapters of exercises, students can easily download.

2元树的先根遍历算法，中根遍历算法，后根遍历算法-2 yuan tree traversal algorithm first root, root traversal algorithm, after the root traversal algorithm