资源列表
bst.c
- binary search tree( add, delete, search,traversal ..)
tree
- 对二叉树进行创建，并对里面的内容进行插入，排序，删除等操作-Right to create a binary tree, and the contents inside the insert, sort, delete and other operations
hanglieshi
- 求解行列式，并且求解行列式，以及求解行列式-Solving the determinant, and solving the determinant, as well as solving the determinant
exchange
- 这是一个二叉树左右子树交换的简单程序，希望对大家有用！-This is a binary tree so the simple sub-tree exchange procedures in the hope for all of us!
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.