Informix SQL教程指南 V9.4，Informix中如何使用SQL

图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of the rest of the vertices such as the shortest path to map the way! VC interface!

迷宫的又一解法。该算法简单、实用、可读性强，是学习递归和回溯很好的例子。-maze of another solution. The algorithm is simple, practical and readable study is recursive and backtracking good example.

基于c语言和数据库的小型医院管理

这是一个有关决策树分类器中C4.5算法的原程序-This is a decision tree classifiers on which the original algorithm C4.5 procedures

这个系统是同学给我的，主要是要我熟悉Visual Studio 2008 与SQL Server 2008 的结合使用，她说这个系统比较简单也适合初学者使用，我从中学到了很多东西，希望有的同学也能用到这个系统，能简单使用Visual Studio 2008 。

用VB语言实现偏微分方程的解法 包括解边值问题的松弛法、交替方向隐式方法等-VB language PDE solution of the boundary value problems including Xie relaxation method, alternating direction implicit methods

实现运动员日程安排,可以通过一个二维的矩阵在显示安排除-athletes to achieve the agenda, through a two-dimensional matrix display arrangement

这是一个动态创建数据库的原程序是用c++编写的-This is a dynamic database creation of the original procedure was used to prepare the c

图的深度遍历，用二叉树实现，输入时要遵循二叉树的顶点和边数的对应关系-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

vb数据库编程资料，对于想要学习数据库编程的朋友有一定帮助-vb database programming information, want to learn database programming will certainly be helpful to have friends