本程序是一个用prim算法寻找最小生成树的小程序。

VC++访问DAO数据库-VC visit DAO Database

将前缀表达式转为中缀表达式，并画出所建的树-To prefix infix expression to expression, and draw the tree built

这是一个魅力 xml c + + 解析器，如果您需要 xpath，请下载我的其他来源 （快速 c + + xpath 语法分析器）.in 代码 xmltest，这测试解析器，向您展示如何使用解析器。

描写了学生信息管理系统所需要的学生的性别 年龄 成绩 学号等等，可以输出学生信息的平均分和各科成绩，以及相对应的年龄  性别

磁盘文件最优存储问题，设磁盘上有n 个文件f1, f1,fn，每个文件占磁盘上1 个磁道。这n 个文件的检索概率分别是p1, p2, , pn-document optimal disk storage, disk based on documents n f1, f1, fn. each file on disk for a cylinder. N This document retrieval probability were p1, p2, and pn

实现如何上传图片等数据，并存储其至数据库的源码-How do I upload pictures to achieve the data and store it to database source

files useful about dsp programme

校园导游图算法--数据结构中有关图的算法 按v求最短路径 按s求信息； 按q退出； 地图在map图像文件里-campus tour map algorithm-- data structure of the plan according to the algorithm for the shortest path v s by seeking information; Q withdrawal by; Maps map image file

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

人事管理，可用小型企业内部人员管理 采用Delphi编写，登录用户名密码为： admin -Personnel management, small businesses can be used internal staff to manage the preparation of the use of Delphi, the logged-on user name password is: admin