build_max_heap

c-w算法，讲述一种分配运输的节约方法，适合于车辆的调度(c-w algorithm，About one distribution transport saving method, suitable for vehicle scheduling)

说明：  拓扑排序 　 对一个 有向无环图 G进行拓扑排序，是将G中所有顶点排成一个线性序列，使得图中任 意一对顶点u和v，若u，v ∈E，则u在线性序列中出现在v之前。 　 通常，这样的线性序列称为满足拓扑次序的序列，简称 拓扑序列 。 注意： 　 ①若将图中顶点按拓扑次序排成一行，则图中所有的有向边均是从左指向右的。 　 ②若图中存在有向环，则不可能使顶点满足拓扑次序。 　 ③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before. Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence. Note: (1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing. (2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence. (3) a DAG topological sequence usually expressed some scheme is feasible. )

数据结构课程设计 数据结构B+树 B+ tree Library(B+ tree Library)

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

迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)

日历显示，查询1900年后的日历。每一屏显示一年的日历祥情。(Calender dispaling. Acess the calender detail of years after 1900.)

对元素类型为整型的顺序存储的线性表进行插入、删除和查找操作(C++)。(C integer linear sequence of stored data table insert, delete and search operations)

本资料为数据结构的相关试卷，可以帮助大家解决一下有关考试的问题(This information is relevant papers data structure that can help you solve the problems concerning the examination)

poj 实现堆结构的源代码。。。话说其实没什么实际功能好么(poj achieve heap structure of the source code. . . In fact, the actual function of saying okay nothing)

已知二叉树的先序遍历结果，建立二叉树并输出其先序、中序、后序遍历结果(Build a binary tree and print the results of preorder, midorder and postorder traversals based on the known result of preorder traversal)