用邻接矩阵的形式实现了求有向图的强连通分量。

数据结构，清华大学出版社，课件，严蔚敏编著-Data structure, Tsinghua University Press, courseware, edited by Yan Wei-min

编程实现出圈问题。是上《数据结构》时候的一次实习的成果。-Programming problem to achieve a circle. It s a program produced during learning data structure

高斯列主元消元法， 这只是我个人的一种解法，仅供参考。-out PCA Gaussian Elimination Act, this is my personal one solution for reference.

vc++数据库编程ListCombo-vc ListCombo Database Programming

实现多课程的排序问题，符合先修课程安排的要求，可给出多种排课方案！！本程序的亮点是可得出一组课程的所有可能的拓扑排序,故最终结果是多方案的-Scheduling multi-course meet the requirements of Pre-curriculum can be given a variety of arranging schedule the program! ! The highlight of this program can be drawn from a group of courses in all possible topological sort, so the end result is a multi-program! !

SQL Server、Oracle、Sybase、ODBC的JDBC驱动文件，全部测试过-SQL Server, Oracle, Sybase, and ODBC JDBC driver, all tested

数据结构答案2，经多次修改而成，比答案册的还要简单清楚。-answer two data structure, several revisions, the book also answers simple and clear.

数据库基础知识的笔记题集,对初学者进行复习很有用-database

清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;

饭店住房管理服务系统(C#.NET)-hotel housing management system (C#.NET)