资源列表
shunxubiao
- 数据结构中，用C语言的数组实现顺序表结构。-failed to translate
Algorithms
- 包含《算法概论》里面大部分基本算法，自己写的，有比较详细的注释-C code for the algorithms in the book Algorithms (Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani)
TreeDepth
- 通过遍历二叉树，求二叉树的深度 使用是先输入各节点的数据，再得出二叉树的深度-By traversing a binary tree, find the depth of use is the first binary input data on each node, and then arrive at the depth of binary tree
floyd
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。-floyd simple algorithm
Dijkstra
- Dijkstra算法是典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径。-Dijkstra' s shortest path algorithm is a typical routing algorithm used to calculate a node to all other nodes in the shortest path.
up
- 两复数的基本运算,运用数据结构，c语言编程-theprocessof2complexnumbers
prim
- Prim算法用于求无向图的最小生成树. -Prim algorithm is used to seek an undirected graph of the minimum spanning tree
HuffmanOptimalbinarytree
- 利用Huffman算法，构造最优二叉树，它是霍夫曼编码的基础。-Huffman algorithm is used to construct optimal binary tree, which is the basis of Huffman coding.
huffmancode
- huffman编码，能够对输入的序列按权值进行最优二叉树排序，按最优二叉树排序进行简单编码。-huffman coding, be able to input the right values according to the optimal sequence of binary sort order by a simple optimal binary codes.
BiTreeOrder
- 通过C++编写创建二叉树的代码，及实现二叉树的递归和非递归的先序、中序及后序遍历，和层次遍历。-The creation of a binary tree, recursive and non recursive traversal
Bruit_Fox_Algorithm
- 朴素的模式匹配算法，也称布鲁特-福斯算法，实现子串的定位操作。-Simple pattern matching algorithm, also known as the bruit- Fox algorithm to achieve sub-string positioning operation.
KMP
- 改进的模式匹配算法，算法效率提高，和计算next函数修正值的算法。-Improved pattern matching algorithm, algorithm efficiency, and calculate the correct value of the function next algorithm.