资源列表
stack
- 数据结构 递归 算法详细的描述代码，功能完全，适合学习。-Data structure.
MST
- 最小生成树算法，数据结构中的经典算法，其中含测试数据-The minimum spanning tree algorithm
Graph
- 数据结构课程实验源代码，用c语言实现图结构的基本运算，包括有向图和无向图。-Data structures course experiment source code, the basic operations of the graph structure using c language, including directed graph and no directed graph.
APIT_CS-2003-06
- 传统的近似三角形内点测试( APIT),即近似三角形内点测试定位算法,广泛应用于静态节点定位.结合粒子滤波提出改进算法,将APIT算法推广到节点动态定位.-Traditional approximate point inside the triangle test (APIT), namely the approximate point within the triangle test positioning algorithm, widely used in the static node l
collection
- 集合划分，数据结构中运用队列操作，将互斥元素分在不同集合中-Set partitioning, data structure, the use of queue operations
Huffman-coding
- 这是一个实现哈夫曼编码的算法，可以有效解决不等长字符的压缩-This is a Huffman coding algorithm can effectively solve the compression of unequal length character
RK
- 实验RK算法，即利用Hash方法和素数理论，首先定义一个Hash函数（hash (r) = r mod q），然后将模式串P和文本串T中长度为m的子串利用Hash函数转换成数值。显然只需比较那些与模式串具有相同Hash函数值的子串。 当然因为Hash冲突的存在，还要进一步进行字符串比较，但只要选择适当的素数q, Hash冲突的概率就会很小 -Experimental RK algorithm, namely the use of Hash methods and prime number
Huffman-c-code
- 用C语言Huffman程序源码，适于数据压缩和数据编码研究方面进行参考，变换方法即可实现各种数据的压缩-Performed using C language reference Huffman program source code, suitable for data compression and coding research data transformation method can achieve a variety of data compression
banker
- 用银行家算法 ，实现资源分配 ，具有显示或打印各进程依次要求申请的资源数以及依次分配资源的情况-With the banker' s algorithm, resource allocation, with the display or print the application of the process followed by the number of resources required and the allocation of resources in order
HFMModel
- 构造哈夫曼树，并构造字符的哈夫曼编码，以凹入表（层次表）的形式显示哈夫曼树。-Huffman tree structure and construct characters Huffman encoding to recessed table (table level) displayed in the form Huffman tree.
3625_kruskal
- 图论基础算法 解决最小生成树问题 克鲁斯卡尔算法加并查集优化-Graph theory based algorithm to solve the problem Kruskal minimum spanning tree algorithm for optimal set of plus and check
ShortRoute
- 本源代码使用C语言，根据运筹学最短路径算法思想，实现了求解最短路径问题-Source code using the C language, according to the shortest path algorithm operations research ideas for solving the shortest path to achieve