OKlibrary
0.2.1.6

Plans for the module with tree datastructures. More...
Go to the source code of this file.
Namespaces  
namespace  OKlib::Trees 
Module for trees (algorithms and data structures; all kinds of trees)  
namespace  OKlib 
All components of the OKlibrary. 
Plans for the module with tree datastructures.
vertex_type<Tree>::type;
fully constructible with equality and with singular value root(T)
of type vertex_type vertex_type v;
Tree(T, v)
copy constructor for the subtree of T at v children(T, v)
yields a range, whose valuetype is vertex_type parent(T, v)
of type vertex_type (singular iff v == root(T)) property_map(m, T, v)
swap(T1, T2)
swap(T, v, T2, v2)
swaps the subtree of T at v with the subtree of T2 at v2 (swaps do not invalidate vertex descriptors nor iterators, but their meaning change). in_order(T, v), pre_order(T, v), post_order(T, v)
yield ranges to traverse the subtree of T at v. new_child(T, iterator)
returns vertex_type with parent v, inserts at iterator (if iterator is begin, then this is frontinsertion, if iterator is end, then this is backinsertion) remove_child(T, iterator)
(again vertex descriptors and iterators are not invalidated (if possible), by both operations). Definition in file general.hpp.