we

自己用c语言写的一个模块化多电平最近电平调制排序的c程序，希望对大家有帮助(Own use c language written in a modular multi-level modulation level recently sort of c program, we hope to help)

无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)

数据结构中的用kmp算法查找关键字，供初学者参考(Data structure using kmp algorithm to find the keyword reference for beginners)

数据结构与算法分析的 C++检索代码，很经典(the code of Data structure)

有向图的邻接表存储的实现，包括有向图的各种操作(Directed graph adjacency list storage implementation, including a variety of operations to the map)

利用串来比较数据大小，代码中有两个串，通过串来比较大小( 10/5000 Use the string to compare the data size)

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

说明：  从最后一个非叶子结点开始从后往前进行调整，保证了根下的所有子树都是最大堆，最后对根进行调整，使整棵二叉树为最大堆，保证了根结点为整棵数的最大值点，完成了建堆的过程，再将根结点跟最后一个结点进行交换，如此反复操作，则堆排序就完成了，其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)

说明：  用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。(from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.)

一个KDtree的程序，包含建树过程和消耗的时间。(A KDtree procedures, including the contribution to the process and time consuming.)