C1

数据挖掘中聚类算发中基于密度的算法DBSCAN(Hair count data mining clustering algorithm DBSCAN density-based)

邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)

Monkeys and peach,Monkeys and peach(Monkeys and peach)

链表的模板类,提供插入删除，遍历器，查找等功能，只有一个头文件，可以包含到你的工程(template implemention of Chain)

一道poj上的问题的解答，棋盘上的距离问题。即实现棋盘上从一个点移动到王，后，兵之间最短步数的解答。(A poj answers to your questions on the chessboard distance problem. That is, move from one point to the king on the board, after the shortest number of steps between the soldiers answer.)

VC简易通讯录，加强C的编程，熟悉链表文件的使用等。(Simple VC contacts, strengthen C programming, familiar with the use of a linked list file.)

数据结构课设，城市地铁站的设计与使用规划(Set data structure class, subway station design and use of planning)

该代码实现了深拷贝的问题，对于深拷贝进行了一系列的介绍，并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)

数据结构（第四版）第二章上机实验题源程序答案详解(Data structure (fourth edition) chapter on lab answer questions Detailed source)

选择型结构c语言编程 (Choose the type of structure of C language programming)