| _firstFreeEdge | OrderedTree< NodeType, EdgeType > | |
| _firstFreeNode | OrderedTree< NodeType, EdgeType > | |
| _numEdges | OrderedTree< NodeType, EdgeType > | |
| _numNodes | OrderedTree< NodeType, EdgeType > | |
| _prepareEdge(const int edgeId, const int from, const int to) | OrderedTree< NodeType, EdgeType > | inlineprotected |
| addEdge(const int from, const int to, const int extraSpace=0) | OrderedTree< NodeType, EdgeType > | inline |
| addNode() | OrderedTree< NodeType, EdgeType > | inline |
| addNodes(const int n) | OrderedTree< NodeType, EdgeType > | inline |
| avgDepth() const | OrderedTree< NodeType, EdgeType > | inline |
| checkConsistency() | OrderedTree< NodeType, EdgeType > | inline |
| clear() | OrderedTree< NodeType, EdgeType > | inline |
| compact(const bool verbose=true, const int factor=1) | OrderedTree< NodeType, EdgeType > | inline |
| compactNode(const int nodeId) | OrderedTree< NodeType, EdgeType > | inline |
| edgeId(const EdgeType *edge) | OrderedTree< NodeType, EdgeType > | inline |
| edges | OrderedTree< NodeType, EdgeType > | |
| edgeType typedef | OrderedTree< NodeType, EdgeType > | |
| firstEdge() | OrderedTree< NodeType, EdgeType > | inline |
| firstEdge(const int u) | OrderedTree< NodeType, EdgeType > | inline |
| firstEdge(const int u) const | OrderedTree< NodeType, EdgeType > | inline |
| foldLeftPostOrder(const Callback &callback, const Fold &fold, const T initial) const | OrderedTree< NodeType, EdgeType > | inline |
| height() const | OrderedTree< NodeType, EdgeType > | inline |
| initialise(const int n, const int m) | OrderedTree< NodeType, EdgeType > | inlineprotected |
| inplaceCompact(const bool verbose=true) | OrderedTree< NodeType, EdgeType > | inline |
| inplaceCompact(std::vector< bool > &dirty, const bool verbose=true) | OrderedTree< NodeType, EdgeType > | inline |
| isEqual(const OrderedTree< NodeType, EdgeType > &other, LabelType &labels, LabelType &otherLabels, const bool verbose=false) const | OrderedTree< NodeType, EdgeType > | inline |
| killNodes() | OrderedTree< NodeType, EdgeType > | inline |
| lastEdge() | OrderedTree< NodeType, EdgeType > | inline |
| lastEdge(const int u) | OrderedTree< NodeType, EdgeType > | inline |
| lastEdge(const int u) const | OrderedTree< NodeType, EdgeType > | inline |
| mergeChain(const int middleId, MergeType &mergeType) | OrderedTree< NodeType, EdgeType > | inline |
| mergeSiblings(const EdgeType *leftEdge, const EdgeType *rightEdge, int &newNode, MergeType &mergeType) | OrderedTree< NodeType, EdgeType > | inline |
| nodeId(const NodeType *node) | OrderedTree< NodeType, EdgeType > | inline |
| nodes | OrderedTree< NodeType, EdgeType > | |
| nodesEqual(const OrderedTree< NodeType, EdgeType > &other, LabelType &labels, LabelType &otherLabels, const int nodeId, const int otherNodeId, const bool verbose=false) const | OrderedTree< NodeType, EdgeType > | inline |
| nodeType typedef | OrderedTree< NodeType, EdgeType > | |
| operator<<(std::ostream &os, const OrderedTree< NodeType, EdgeType > &tree) | OrderedTree< NodeType, EdgeType > | friend |
| OrderedTree(const int n=0, const int m=0) | OrderedTree< NodeType, EdgeType > | inline |
| OrderedTree(const OrderedTree< NodeType, EdgeType > &other) | OrderedTree< NodeType, EdgeType > | inline |
| removeEdge(const int from, const int edge, const bool compact=true) | OrderedTree< NodeType, EdgeType > | inline |
| removeEdgeTo(const int from, const int to, const bool compact=true) | OrderedTree< NodeType, EdgeType > | inline |
| shortString() const | OrderedTree< NodeType, EdgeType > | inline |
| summary() const | OrderedTree< NodeType, EdgeType > | inline |
| toString() const | OrderedTree< NodeType, EdgeType > | inline |
| traverseFoldLeftPostOrder(const int nodeId, const Callback &callback, const Fold &fold, const T initial) const | OrderedTree< NodeType, EdgeType > | inline |
1.8.9.1
