| __Child_data_iterator< _Iterator, _Node > | Iterator adapter for iterating through children data hooks |
| __DG< _Tp, _Ctr, _Iterator, _CIterator, _Inserter, _Alloc > | Directed graph base class |
| __ITree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc > | Tree base class with data hooks |
| __LDG< _Tp, _Te, _Ctr, _Iterator, _CIterator, _Inserter, _NAlloc, _EAlloc > | Labelled directed graph base class |
| __one_iterator< _Tp > | Make an iterator out of one pointer |
| __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc > | Tree base class without data hooks |
| __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc > | Tree base class |
| _DG_base< _Tp, _Ctr, _Iterator, _CIterator, _Alloc > | Directed graph base class for allocator encapsulation |
| _DG_iterator< _Tp, _Ref, _Ptr, _Ctr, _Iterator, _CIterator > | Iterator through the directed graph |
| _DG_node< _Tp, _Ctr, _Iterator > | Directed graph node |
| _DG_walker< _Tp, _Ref, _Ptr, _Ctr, _Iterator, _CIterator > | Recursive directed graph walkers |
| _G_compare_adaptor< Predicate, _Node > | Adaptor for data comparison in graph nodes |
| _ITree_node< _Tp, _Ctr, _Iterator > | Tree node for trees with data hooks |
| _LDG_base< _Tp, _Ctr, _Iterator, _CIterator, _Te, _NAlloc, _EAlloc > | Labelled directed graph base class for allocator encapsulation |
| _LDG_edge< _Te, _TN > | Labelled directed graph edge |
| _LDG_iterator< _Tp, _Ref, _Ptr, _Ctr, _Iterator, _CIterator, _Te > | Iterator through the directed graph |
| _LDG_node< _Tp, _Ctr, _Iterator > | Labelled directed graph node |
| _LDG_walker< _Tp, _Ref, _Ptr, _Ctr, _Iterator, _CIterator, _Te > | Recursive labelled directed graph walkers |
| _RTree_walker< _Tp, _Ref, _Ptr, _Ctr, _Iterator > | Recursive tree walkers |
| _Tree_alloc_base< _Tp, _Ctr, _TI, _Allocator, _IsStatic > | Tree base class for general standard-conforming allocators |
| _Tree_alloc_base< _Tp, _Ctr, _TI, _Node, _Allocator, true > | Tree base class specialization for instanceless allocators |
| _Tree_base< _Tp, _Ctr, _TI, _Alloc > | Tree base class for allocator encapsulation |
| _Tree_data_hook | |
| _Tree_iterator< _Tp, _Ref, _Ptr, _Ctr, _Iterator > | Iterator through the tree |
| _Tree_node< _Tp, _Ctr, _Iterator > | Tree node for trees w/o data hooks |
| _Tree_walker< _Tp, _Ref, _Ptr, _Ctr, _Iterator, _Node > | Automatic tree walkers |
| _Tree_walker_base< _Tp, _Ref, _Ptr, _Ctr, _Iterator, _Node > | Base class for all tree walkers |
| atree< _Tp, _AssocCtr, _Key, _Compare, _PtrAlloc, _Alloc > |  -ary forest with labelled edges |
| child_data_iterator< _Tree > | Iterator which iterates through the data hooks of all children |
| dag< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | Unlabeled directed acyclic graph (DAG) |
| dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | Unlabeled directed graph |
| ldag< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | Labeled directed acyclic graph (LDAG) |
| ldgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | Labeled directed graph |
| ntree< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | -ary forest |
| pair_adaptor< _Iterator > | Adaptor for an iterator over a pair to an iterator returning the second element |
| pointer_adaptor< _Compare > | Adaptor transforming a comparison predicate to pointers |
| postorder_visitor< _Node, _Ret, _Col > | Postorder visitor base class |
| preorder_visitor< _Node, _Ret, _Col > | Preorder visitor base class |
| prepost_visitor< _Node, _Ret, _Col > | Pre+postorder visitor base class |
| ratree< _Tp, _AssocCtr, _Key, _Compare, _PtrAlloc, _Alloc > | -ary forest with labelled edges |
| rntree< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | -ary forest |
| rstree< _Key, _Compare, _AssocCtr, _PtrAlloc, _Alloc > | -ary forest with unsorted edges |
| stree< _Key, _Compare, _AssocCtr, _PtrAlloc, _Alloc > | -ary forest with unsorted edges |
1.5.8