资源列表
algorithms
- 关于c++的全英文相关算法介绍，想详细，很旺对大家有用-C++ on the correlation algorithm described in English, to detail, very busy for all of us
SearchMultimediaDatabasesbyContent
- CMU的C. Faloutsos撰写的关于基于内容的多媒体搜索的书籍 是高级数据结构的一本很好的参考书-CMU' s C. Faloutsos written content-based multimedia search on the books are advanced data structures a very good reference book
anyhex
- c语言的数据结构,实现了任意进制数值到任意进制数值转换-c language data structure to achieve any hexadecimal value to convert any hexadecimal value
tdistance-stringlabel
- 计算任意两棵树结构间的编辑距离，是Zhang和Shasha提出来的，时间复杂度为O(V*V *min(L, D)*min(L , D -compute the edit distance between two tree structures, it s proposed by Zhang and Shasha , time complexity is O(V*V *min(L, D)*min(L , D ))
seqlist
- 数据结构里面的顺序表的C++实现,功能很多 只有头文件，主函数可以自己写-data structure using c plus plus
classical-example-of-CaCPP
- 经典c/c++ 算法 图论算法 、数论算法、背包问题、排序进制转换算法、高精度计算、树的遍历、 全排列与组合的生成、查找算法、贪心算法等大全，word文档中-Classic c/c++ algorithm graph algorithms, number theory algorithms, knapsack problem, sort binary conversion algorithm, high-precision calculation, the tree traversal, all
huffman
- 关于huffman树的编码，很容易理解容易看的懂-Huffman encoding on the tree, it is easy to understand easy to see understand
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
y
- 利用VC++实现约瑟夫环 利用VC++实现约瑟夫环 -Using VC++ to achieve Joseph Central
ApiHelp
- 本人在学习和工作中收集并整理的一份API资料及一些常用数据结构的资料-I study and work in and organize a collection of API data and information on some commonly used data structures
BinarySearchTree
- 用C++实现了二叉排序树的插入和删除操作，对于如何用链式结构实现树的各种操作是一个很好的学习源程序，经调试没有错误。-Achieved with C++ binary sort tree insertion and deletion operations, chain structure for how the various operations to achieve the tree is a good learning source, no errors after debugging.
BSTSolveKnap
- 用二叉树实现了背包问题的一种新解法，对学习链表和树数据结构是一个很好的学习程序，程序经调试运行正确，C++实现。-Knapsack problems with binary tree implemented a new method of learning lists and tree data structure is a good learning process, program debugging and running right through, C++ implementation