资源列表
hf
- 哈夫曼树是一种带权路径长度最短的树。 所谓路径长度就是某个端结点到树的根结点的距离,等于该端结点的祖先数,或该结点所在层数减1,用lk表示。-Huffman tree is a weighted length of the shortest path tree. The so-called path length is a client node to the tree root node of the distance, equal to the end of the ancestors of
bianlioferchashu
- 二叉排序树的建立及中序遍历 二叉排序树的建立及中序遍历-Binary Sort Tree Establishment and traversal in binary sort tree establishment and traversal
reverse
- 三次反转算法 是一个线性时间算法 实现数组的反转 有详细的注释-Three inversion algorithm is a linear time algorithm inversion array detailed notes
wangnianlidesuanfa
- 关于多工能数字时钟的年月日及闰年和平年的算法-On the multi-tasking digital clock date and the leap year algorithm Year of Peace
kruskal
- kruskal算法 很经典的 使用C语言实现，在数据结构中很实用-Kruskal algorithm is a classic use of C language, data structure in a very practical
org
- 使用Java开发的图论算法的包，里面含有图论的各种算法，如：地杰斯特拉，图的遍历算法-Java development using graph theory algorithms package, which contains a variety of graph theory algorithms, such as: to杰斯特拉, graph traversal algorithm
xuefen
- c开发的选课算法，很重要的算法，经典的算法，很值得参考-c course algorithm development, it is very important algorithm, the classical algorithm, it is worth considering
libout
- 在学校自编的一段程序,这是一个图书室管理的纯属C语言的程序-Own section in the school program, which is a pure C library management procedures for language
shujujieg2006
- 数据结构的一些教程....比较适于初学者-Some of the data structure better suited for beginners tutorial ....
prim
- 二叉树中的prim最小生成树算法。编译环境：vistual stdio 2008-Binary tree in the minimum spanning tree algorithm prim. Compiler environment: vistual stdio 2008
shujujiegou
- 今年的数据结构严蔚敏版的 课件及其演示 内容挺全的 希望对正在学习数据结构的朋友有帮助 -This year s data structure YAN Wei-min demonstration version of the courseware and its content very wide the hope of learning the data structure is a friend help
strap_down_inertial_navigation
- 捷联系统C语言实现算法，已经过实验验证。-SINS C language algorithm, has been verified by tests.