Using VC++ and SQL to achieve a trade management system

java客房管理系统-java客房管理系统！！！！！！！！！！

数据结构与算法-程序、素材Kruskal构造算法-Data Structures and Algorithms- procedures, materials Kruskal Algorithm

这些是数据结构结构的经典实现算法，是学习数据结构必须掌握的-shu ju jie gou jing dian suan fa shi xian

本程序用来学校管理学生挡案用. 采用Access数据库,程序实现关键在应用ODBC 的两个类.-procedures for the management of schools with students archives. Access database, program lies in the application of two types of ODBC.

一种基本算法！ 现有一个酒店有100个房间，依次编号为1到100，第一个服务员经过，将所有房间门关上；第二个服务员经过将所有编号为2的倍数房门打开；第三个服务员经过将所有编号为3倍数的房门打开的关上，关闭的打开。依此类推；输入一个100以内的正整数N，输出第N服务员经过之后，所有房间的状态。-a basic algorithm! An existing 100 hotel rooms, followed by No. 1-100, after an attendant, all rooms will be closed; Second attendants after all No. 2 in multiples door open; Third attendants after all No. 3 multiples of the open door is shut, Guan the opening closed. XII; The importation of a hundred within the positive integer N, N output after attendants, all rooms in the state.

o-r mapping 实现以面向对象的方式建立对关系型数据库的映射。-o-r mapping in order to achieve the object-oriented approach to the relational database mapping.

零件切割问题： 给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小？ 任给一个输入实例，能输出切割所需要的实际高度并能用图形演示切割的过程-cutting parts : a given width of the rectangular plate W, the height of rectangular plate unrestricted. Need from the board is cutting out respectively n height of the hi, wi width of the rectangular parts. Cutting parts to the rules of the height of the rectangular plate with a high degree of consistent direction. Asked how cutting makes use of the rectangular plate height h minimum? As an input for example, will cut output by the needs of the high and can be used graphic demonstration of the cutting proce

基于C#语言的一个物流信息网数据库系统开发案例的源代码 ,很实用-Based on the C# Language a logistics information network database system for the development of cases the source code, it is practical

企业客户关系管理系统-Enterprise Customer Relationship Management System

图论中得kruskal 算法 求解最小生成树 算法为图论中得经典算法 -In graph theory a Kruskal algorithm for minimum spanning tree algorithm in graph theory a classical algorithm