一个不错的宾馆管理系统

商品交易管理数据库-commodity transaction management database

成绩查询使用，是个课程设计-results for use, is a curriculum design

用vb语言，在access数据库中完成的代码，是最简单的平台下的数据库。有完善的功能系统，添加，删除，修改等等。access数据库的密码在代码演示框中左下角有，或者使用access密码暴力破。解器可以解决，其他都不是问题，是初学者学习的很好的资料。背景的图片可以替换，换成自己喜欢的背景，建议用学校本身的徽章等

// kmeans.c//伊桑·布罗德斯基2011年//月#include#include#include＃定义SQR（X）（（X）*（X））＃定义MAX_CLUSTERS16＃定义MAX_ITERATIONS100＃定义BIG_double（INFINITY）无效失败（字符*海峡）{的printf（STR）;出口（-1）;}双calc_distance（INT暗淡，双* P1，双* P2）{双distance_sq_sum= 0;对于（INT II=0;二

简单的迷宫程序，是基本的数据结构入门程序，适合初学者学习-A simple maze procedure, is the basic data structure entry procedures

一道北大acm的试题，用双向链表实现模拟内存分配的程序-1 Peking University acm of examination questions, with two-way linked list of memory allocation procedures for analog

学习C语言时，编写的一个多项式刮号检查程序 主要用栈实现的。-C language study, prepared by a polynomial scratching, the main inspection procedures Stack realized.

火车查询 利用vb6.0 与数据库access开发 可以完成火车的查询功能-use vb6.0 train inquiries database access and the development of the trains will be completed inquiry

求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵 (3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q

数据结构中关于图的遍历，任意建节点，深度优先和广度优先两种方法-data structure on the map traverse, arbitrary nodes built, the depth and breadth of priority priority two methods