搜索资源列表
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
Serialization
- 序列化（Chapter 14. Serialization）。一个非常简单的序列化程序，用于将完整的游戏实体树保存到磁盘中或从磁盘中载入。它使用一个自定义的流类和指针恢复方法（注：本章程序如在VC6.0环境编译，则要采用第三方的stl，比如sgi的stl：http://www.sgi.com/tech/stl/。可使用VC7.0，程序在VC7.0下可以编译通过）。-sequence of (Chapter 14. Serialization). A very simple sequence of
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,
bimap
- STL扩展功能的二叉树比STL的二叉树好用-STL expanded the binary tree than the binary tree handy STL
TCL_4_07
- The Tree Container Library (TCL), presented here, is a generic tree container library which, not only works much like the STL, but is also compatible with the STL algorithms.
rb-tree
- 红黑树的算法，网上有好多例子，包括移植STL中的RBTREE算法，但是我试了，不怎么好用阿。 这是麻省理工数据结构课程的一个实现，我把它改造了一下，经过30-40万的数据量测试 windows/unix下都做过测试，没有问题。
tic-tac-toe
- 一个简单的用二叉树实现的极大极小指算法人工智能井字棋游戏，使用C++的类，和STL模版库中的vector-A simple binary tree the minimax means algorithm artificial intelligence tic-tac-toe game of chess the class of C++, and STL template library in the vector
Cayley
- Cayley 定理的实现 stl编写 树与序列的一一对应关系-Cayley theorem stl prepare the realization of the tree with one-to-one relationship between sequence
libkdtree_0.7.0
- 一个KD-tree的类STL模板库，版本为0.7.0-libkdtree++ is an STL-like C++ template container implementation of k-dimensional space sorting, using a kd-tree.
FibonacciNumber
- C++高效算法 最小生成树的遍历查找 从STL中分析出来的 -C++ and efficient traversal algorithm for minimum spanning tree analysis to find out from the STL
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
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
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
B-Tree
- 纯粹算法，实现B减树，当然无法跟stl的代码比，但是可以从中看到B减树的实现过程。-Pure algorithm, the B tree, of course, can not be compared with stl code, but you can see the B tree implementation process.
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