数据库查询、显示程序，使用access数据库，需要配置数据库程序才能使用...

数据结构 详细描述了如何链栈的方法以及操作-Data structure described in detail how the chain stack method and the operation of

这是LabwindowsCVI得数据库开发支持包，安装后可获得相关数据库驱动、数据库开发工具的.DLL和.fp-LabwindowsCVI,SQL TOOLKits

这个是Hilbert曲线的实现算法,可以具体演示出每级曲线的绘制过程,最多可实现8级曲线的绘制.-Hilbert Curve is the realization of the algorithm can be demonstrated that each specific grade curve of the process of drawing up to achieve eight curve drawing.

骑士遍历问题，在一个n*n个方格的国际象棋棋盘上，马（骑士）从任意指定方格出发，按照横1 步竖2 步，或横2 步竖1步的跳马规则，走遍棋盘的每一个格子，且每个格子只走1次。-Knight, in an n* n box at the international chess board, Ma (Knight) from the arbitrary designation box and, in accordance with a further horizontal two-step vertical, horizontal or a vertical two-step further vaulting horse rules traveled a checkerboard lattice of each and every one lattice just take time.

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.

四色算法代码，已经在OMNETPP平台上编译成功！-Algorithm for four-color code has been compiled successfully OMNETPP platform!

很多的vb经典源代码-many classic vb source code

一个实现基因表达式编程来解决函数发现问题的小程序-a realization of gene expression programming to solve the problems identified in the function of small procedures

用vc基于数据库编程源代码-with vc-based database programming source code

最短路径方法The shortest path method-The shortest path method