LabVIEW将图形中的数据存入数据库中

界面效果，用ACCESS编写的程序界面

数据结构示例

按克鲁斯卡尔（Kruskal）算法思想，编制一个寻找最小生成树的完整的程序。

大整数整除，char *d返回余数，char*c返回结果 -Large integer divisible, char* d return the remainder, char* c return result

access数据库，实现教务管理的功能-access databases, realize the functions of educational administration

做的非常好的论坛，数据库采用access。数据库在db文件夹下，在odbc注册db2000为系统DSN，就可以使用了-To do a very good forum, the database used access. Database in the db folder, db2000 for registration in the odbc system DSN, you can use the

用数据结构实现基本算法 用C++实现车务管理，需用到栈基本数据结构-data structure used to achieve basic algorithm to achieve C bus services management, needed to stack the basic data structure

关于货箱装船问题的贪婪算法，只是简要描述-Container ship on the issue of greedy algorithm, only a brief description of

家族信息管理系统，实现人员的各信息管理-family information management system, the members of the Information Management

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