使用汇编写的二叉树遍历，我用的是按层存储算法，容易理解...

数据库基础教程chm-database based tutorial chm

pb实现的气泡窗口，非常实用-pb achieve the bubble window, a very practical

这是开发的客户关系管理系统，有源代码和发布版本版-This is the development of customer relationship management systems, and active code releases version

数据结构中的快速排序算法演示及其相关算法源码-data structure of the Quicksort algorithm and demonstrated correlation algorithm source code

资源描述这个项目的目的是开发一个在线帮助台（OHD）在校园和工业设施。这是一个基于内联网的应用程序可以在整个校园内访问。该系统可用于自动化的校园内各种设施的服务请求的工作流程。这是一个集成的系统，涵盖不同种类的设施，如教室，实验室，宿舍，食堂，食堂，体育馆，计算机中心，教师俱乐部等注册用户（学生，教师，实验室助理和其他人将能够登录的要求任何支持设施的服务。这些请求将被发送到有关人，谁也是有效的用户的系统，让他们得到解决。有功能类似电子邮件通知/提醒，增加了一个新的设施系统、报表生成器等。

vb做的，好有意思，-vb done, good interesting.

该源码为酒店等使用的源码，使用java语言编写。具有GUI图形界面，使用jdbc来连接数据库。软件架构很合理，尤其是代码很简洁。-The source for the hotel such as the use of the source, use the java language. Graphical interface with a GUI, use jdbc to connect to database. Software architecture is very reasonable, especially in very concise code.

Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part.

c++实现的程序，真正实现查询，最短路径-c achieve the procedure, the actual realization of inquiries, the shortest path

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