搜索资源列表
NudtCommonTree
- 由STL扩展的树范型。该范型支持边的加权。树封装了内存管理，使得程序员免予释放、分配节点内存。附有实例程序-STL extended by the tree-Fan. Fan support for the type of edge-weighted. Tree Packaging, a memory management, allowing programmers to exempt from release, distribution nodes memory. With examples
AVLTreeImpl
- AVL Tree implementation: I also included a test function to compare the AVL Tree performance with STL Set and Map. Compile the source mavltree.cpp and run it to see the result!-AVL Tree implementation : I also included a test to compare the fu
tree-2.03
- 一个德国人Kasper Peeters用C++ template写的tree的STL实现，并和STL其他容器vector，map一样，提供标准STL接口，供用户调用。非常有参考价值，说明文档参见tree.pdf。-a German Kasper Peeters C template to write the tree S TL realized, and other containers and STL vector, map, providing standard STL interface,
rb-tree
- 红黑树的算法，网上有好多例子，包括移植STL中的RBTREE算法，但是我试了，不怎么好用阿。 这是麻省理工数据结构课程的一个实现，我把它改造了一下，经过30-40万的数据量测试 windows/unix下都做过测试，没有问题。
Cayley
- Cayley 定理的实现 stl编写 树与序列的一一对应关系-Cayley theorem stl prepare the realization of the tree with one-to-one relationship between sequence
STLinusagemap
- map中由于它内部有序，由红黑树保证，因此很多函数执行的时间复杂度都是log2N的，如果用map函数可以实现的功能，而STL Algorithm也可以完成该功能，建议用map自带函数，效率高一些。 -map due to its internal and orderly to ensure the tree by the red and black, many functions of the time complexity of the implementation are log2N,
tree-2.65.tar
- 这是一个表示数据结构tree的c++模板对象,封装的非常好.tree-msvc.hh能在 visual c++下使用,如同使用stl标准模板类库一样-This is a tree data structure that the c++ template object, the package is very good. Tree-msvc.hh be able to use visual c++, as the use of standard template library stl the s
tree-2.65.tar
- tree-2.6.5用STL写的一个多叉树，经过测试，稳定-tree-2.6.5 with STL written more than one tree, tested, stable and
BST
- 搜索二叉树的STL实现。包含树的前序、中序、后序遍历。-STL binary tree search implementation.
include
- 一个二叉树算法的MAP的template，使用与分配内存，经测试（顺序插入256万条数据）效率比STL高5倍。乱序插入256万条数据，是stl的2倍。-A B-Tree Map template,It 5 times faster than the stl::Map.(Test insert 2.56M datas in sequential order. 2 times faster in random order.)
LAB
- 使用C++的STL数据结构实验，包括链表、八皇后、扩展洗车仿真、Binary Search Tree的平均树高等问题的实验-Using C++, STL data structure experiments, including lists, eight queens, extended car wash simulation, Binary Search Tree problems as the average tree experiment
tree-2.65
- 类STL的Tree Class. Open Source. 很多项目都有用到。作者：Kasper Peeters reference:http://tree.phi-sci.com/-a STL-like Tree Class which created by Kasper Peeters. It is an open source file and has already widely used in many mature projects
STL
- 详细的讲述一些C排序的函数 STL 几乎封装了所有的数据结构中的算法，从链表到队列，从向量到堆栈，对hash 到二叉树，从搜索到排序，从增加到删除-Describe in detail the function of some sort STL C encapsulates almost all of the data structure algorithms, from the list to the queue, from the vector to a stack of hash to
ACM.ICPC_Code_base_MyLib(For_ACM)
- 吉林大学. ACM/ICPC 代码库,关于图论、数据结构、网络流、树论、递归方法求解排列组合问题,以及ACM/ICPC之STL.-Jilin University. ACM/ICPC code base, on the graph theory, data structures, network flows, the tree of recursive method for solving permutation and combination, as well as ACM/ICPC of t
stx-btree-0.8.3
- 用b+树算法实现的map,set容器，查找速度超快-map,set container base on B+tree algorithm 。can search faster than the STL container base on RBtree algorithm
hash
- 采用六种数据结构（数组、链表、STL、箱、二分查找树、位向量），实现统计存储若干个随机数所需要的时间。-Using six data structures (arrays, lists, STL, containers, binary search tree, bit vector), to achieve a number of statistical random number stored in the time required.
tree-2.81.tar
- 一个通用的STL风格的N叉树实现，高效稳定-A generic STL-N-tree implementation, efficient and stable
STL-queue--
- STL、线段树代码库 关于队列和栈的有关STL的操作vc++实现-STL, the segment tree code library
STLTEST1
- 一个有关stl操作的程序，实现了平衡二叉树，还有相关的数据结构，供大家学习-A related stl operating procedures, to achieve a balanced binary tree, as well as associated data structures for them to learn
STL
- 源码之前了无秘密，你将看到vector的实现、list的实现、heap的实现、deque的实现、Red Black tree的实现、hash table的实现、set/map的实现;你将看到各种算法(排序、查找、排列组合、数据移动与复制技术)的实现;你甚至能够看到底层的memory pook和高阶抽象的traits机制的实现。(Before the secret source code, you will see the vector implementation, list implement