huffman_tree

对首先产生20个随机数进行基数排序,是利用C++实现的(On the first 20 random numbers generated for the base sequencing is the use of C++ Realize the)

清（英文）常见数据结构，代码实现，值得下载，值得分享(Qing (English) common data structure, code implementation, worth downloading, worth sharing)

数据结构简单的课程设计交通换乘算法,里面有零次换乘与一次换乘(Simple structure, curriculum design data traffic transfer algorithm, which have zero time transfer and a transfer)

排序，各种排序算法，插入排序，冒泡排序，快速排序，等等！(Sorting, various sorting algorithms, insertion sort, bubble sort, quick sort, and more!)

江苏大学数据结构研究生试题2009Jiangsu University graduate examination papers(Jiangsu University graduate examination papers)

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

哈夫曼树，基本的数据结构，用来编码和解码、用数组作为存储结构实现，

本代码提供一种非常简单且快速的哈夫曼编码方法。 (this code provide a very simple and rapid method of Huffman coding.)

使用C语言编写的AOV网的拓扑排序，内附有详细的源码解释和输入示意图(Using C language AOV network topological sorting, enclosing a detailed explanation and input source diagram)

克鲁斯卡尔算法思想.cpp int seekedge(EDGE * (&a), int n) void bubble(EDGE * (&a), int size) void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针，a2是最小生成树边集的头指针，k为所要删的边 void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )