| AllNodeIterator | This iterator iterates over all nodes that follow a given node (with no respect to the root of node) |
| CollectVisitor | This visitor collects all nodes into a vector which is provided through 'getList()' |
| DefaultOutputStrategy | This OutputStrategy writes the node-type and name to 'cout.' |
| DepthVisitor | This visitor measures the maximum depth of the tree, which is the distance from the given node to the farest leave. The distance is provided through 'getDepth()' |
| IterNodeTraversal | Produces a traversal using the given Iterator |
| LayoutVisitor | The LayoutVisitor is used to position the tree nodes on a plane |
| LeaveIterator | This iterator iterates over all leaves that belong to a given node (have the same root) |
| Node | This class provides the basic interface to the node-classes |
| NodeIterator | This iterator iterates in preorder over all nodes that belong to a given node (have the same root) |
| NodeTraits | |
| UnConst | |
| UnConst< const U > | |
| NodeTraversal | Base class for Traversal classes, that walks through a tree and returns a container with all visited nodes |
| NodeVisitor | Visitors are used to extend the Node classes without changing their implementation ('visitor pattern') NodeVisitor is the base class of all visitors. Visitors use an iterator to traverse the tree. So the result depends on the given iteration algorithm. If set to non-recursive they only visit one node. The default value is true, so the visitor works recursively |
| NodeVisitorBase | Visitors are used to extend the Node classes without changing their implementation ('visitor pattern') NodeVisitor is the base class of all visitors. Visitors use an iterator to traverse the tree. So the result depends on the given iteration algorithm. If set to non-recursive they only visit one node. The default value is true, so the visitor works recursively |
| NodeVisitorBase< const Node< _TContent >, const NormalNode< _TContent >, const RootNode< _TContent >> | |
| NodeVisitorBase< Node< _TContent >, NormalNode< _TContent >, RootNode< _TContent >> | |
| NonCopyable | Private copy constructor and copy assignment ensure classes derived from class noncopyable cannot be copied |
| NormalNode | |
| NullOutputStrategy | NullOutputStrategies are used to define the output-format of the tree -this one is a placeholder, which doesn't produce any output |
| OutputStrategy | OutputStrategies are used to define the output-format of the tree. They are used together with an OutputVisitor which calls their methods appropriately |
| OutputVisitor | OutputVisitor is used for output of the tree. It uses an configurable OutputStrategy (see OutputStrategy), 'DefaultOutputStrategy' if none is given |
| Position | Position holds the x- ,y-coordinate of a point |
| PostOrderNodeIterator | This iterator iterates over all nodes in post order that belong to a given node (have the same root) and are not fixed |
| PostOrderNodeTraversal | Produces a traversal in postorder. Descends first recursively and visits node then |
| PreOrderNodeTraversal | Produces a traversal in preorder. Visits node first and descends then recursively |
| RootNode | |
| StreamIn | Stores an input stream with and offers an interface to set/get the input stream |
| StreamOut | Stores an output stream with and offers an interface to set/get the output stream |
| StreamOutputStrategy | This OutputStrategy is used as base-class for all OutputStrategies which write to a stream |
| TEXGraphOutputStrategy | This strategy writes the nodes in TEX format |
| VariableNodeIterator | |
| VirtualCopyable | This doesn't work as I'd like to :-( |
