huffman

常用的算法经典代码，包括快速排序，冒泡排序等各种排序方法，还有二叉树的前序、中序和后序遍历等(The classic algorithm code, including quick sort and bubble sort sorting methods, as well as the preamble of the binary tree, inorder and postorder traversal, etc.)

迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)

说明：  子集和数问题.rar，用C++写的，可以运行(Subset of several problems. Rar, written in C++, you can run)

数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)

该程序是数据结构中以链表存储形式来求两个集合的交集，用C++语言描述的(The program is the form of a linked list stored in the data structures to seek the intersection of two sets, C++ language to describe)

图中计算最短路径，必须覆盖所有的节点，效率很高(to compute the shortest path in the graph)

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

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

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

说明：  哈希表，用c++语言编写，可操作运行，结果正确(Hash table, using c++ language, operational run, the results are correct)