Merging Sort: The array is divided into a small array, in an orderly manner thro...

关于数据结构中矩阵转置的算法。-data on the structure of the matrix transpose algorithm.

严蔚敏编写的《数据结构》第9章的答案，全部为源码-the answers of chapter 9 of a book called ‘Data Structures’ writen by Yan Wei Min

根据一段给定的文章构造哈夫曼树并对一段给出的代码译码成为一段文章，输入输出均通过文件来实现，并配有报告文档。-According to the article section of a given structure of the Huffman tree is given a section of the code decoding to become a section of articles, input and output are achieved through the document and the document with the report.

数据算法，凉东问题-data algorithm, the cooler East problem

本文 ASP 的帮助下，您将学习必要的步骤以输出一个 ASP 页上的文件的源代码。通过小的编码片段中，作者解释了如何使用此 FSO 对象并描述它是如何工作的输出......

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.

在有向图中计算最小生成树---Edmonds s Algorithm-Directed graph in calculating minimum spanning tree--- Edmonds s Algorithm

这个课程项目完成了给定DAG graph，找到所有拓扑排序并且输出。用到了指针和链表。对于学习C/C++和数据结构比较有帮助。-this course project has output all the topological sorting given the nodes and relation for the DAG graph. This is very helpful for practicing pointer/link list in C/C++ and data structure

顺序查找法 关于数据结构的基本查找算法实现-law on the order of search data structure of the basic search algorithm

构造二叉树，对该二叉树中序，先序，后序遍历-Binary tree structure, the binary tree in order, preorder, postorder