64位以内Rabin

具有n 个顶点的无向网络G的每个生成树刚好具有n-1条边，采用三种不同的贪婪策略来选择这n-1条边。-n vertices to the non-G network spanning tree just with each n-1 edge, using three different strategies to choose greed that n-1 edge.

随机数分布--高斯分布 100个经典源程序-random number

基本数据结构类的定义和实现: MyStack ,MyPoint,MyArc,Graph,MyQueuesMyStack为构造的一个通用的C++模版堆栈类 MyPoint为一个坐标结构MyArc为带权的边类Graph为临街矩阵表示的图MyQueues为按权值顺序存储的边的队列-basic data structure class definition and realization : MyStack, MyPoint, MyArc, Graph, MyQueuesMyStack for a generic structure of the C category MyPoint stack template for a structure MyArc to coordinate with the right side of the street like Graph Matrix plans MyQueues value of the order by the right side of the storage Queue

这是程序是老师提供的源程序，其中包含了方程的离散等解法 值得一学习。-This is the program source code is provided by teachers, including the discrete equations method, etc. It is worth learning.

B树排序算法的实现，还不错。有兴趣的可以看看。-B-tree algorithm to achieve, quite good. Interested parties can look at.

利用C语言实现迷宫算法。 利用随机函数生成迷宫，并显示所有路径！-use C language maze algorithm. Using random function generator maze, and that all paths!

图文资源管理程序,access数据库，保存图像到数据库，读取数据库图像并显示-Graphic resources management program, access the database, save images to the database, read the database and display images

本软件为小型学生信息管理系统，可提供系统管理员的添加、删除、修改，学生信息添加、删除、修改，学生成绩添加、删除、修改功能，还提供简单的查询功能，包括按学生信息的学号、姓名、学院、专业等条件查询，按学生课程的编号、名称、成绩查询学生成绩信息。-The software for small student information management system that provides the system administrator to add, delete, modify, student information to add, delete, modify, student achievement to add, delete, modify features, it also provides simple query capabilities, including by students of information Student ID, name, college, professional conditions, such as query, according to student course number, name, information on student achievement results queries.

适合用来做K_Means 和K_NN的数据，一共150组，分成3个簇。-K_Means and make suitable for K_NN data, a total of 150 groups, divided into three clusters.

SQL Server 数据库结构查看程序(VC源码)-SQL Server database structure viewer program (VC-source)