Tree Compression with Top Trees Revisited
|
A node for an OrderedTree. More...
#include <Nodes.h>
Public Member Functions | |
TreeNode () | |
int | numEdges () const |
Get the number of outgoing edges (both valid and invalid) More... | |
bool | isLeaf () const |
Check whether the node is a leaf, i.e., has no outgoing edges. More... | |
bool | hasOnlyOneChild () const |
int | hasChildren () const |
Check wether the node has outgoing edges (valid or invalid) More... | |
bool | hasMoreThanOneChild () const |
Check wether the node has at last two outgoing edges (valid or invalid) More... | |
Public Attributes | |
int | firstEdgeIndex |
int | lastEdgeIndex |
int | parent |
int | lastMergedIn |
uint | hash |
Friends | |
std::ostream & | operator<< (std::ostream &os, const TreeNode &node) |
A node for an OrderedTree.
Node type for use in OrderedTree You can write other nodes that suit your needs
Note that the member functions do not distinguish between valid and invalid edges!
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
friend |