Aggregate child values of a 'Node', recursively.
Test whether all node names are unique.
Checks whether 'name' is a reserved word, as defined in 'NODE_RESERVED_NAMES_CONST'.
Climb a tree from parent to children, by provided criteria.
Clone a tree (creates a deep copy)
Create a tree for demo and testing
Create a tree for demo and testing
Cumulate values among siblings
Calculates the height of a 'Node' given the height of the root.
Find the distance between two nodes of the same tree
Executes a function on a set of nodes
Find a node by name in the (sub-)tree
Format a Number as a Decimal
Format a Number as a Percentage
Traverse a Tree and Collect Values
Get an attribute from a Node.
Determine the number a 'Node' has after conversion to a phylo object
Names that are reserved by the Node class.
Navigate to another node by relative path.
Create a 'data.tree' Structure With 'Nodes'
Prunes a tree.
Reverts the sort order of a 'Node"s children.
Traverse a Tree and Assign Values
Set a formatter function on a specific node
Sort children of a 'Node' or an entire 'data.tree' structure
Plot a graph, or get a graphviz dot representation of the tree
Write a 'data.tree' structure to Newick notation
Traverse a tree or a sub-tree
Sample Data: A Simple Company with Departments
Convert a a 'SplitNode' from the party package to a 'data.tree' structure.
Convert an object to a 'data.tree' data structure
Convert a 'data.frame' to a 'data.tree' structure
Convert a 'dendrogram' to a data.tree 'Node'
Convert a nested 'list' structure to a 'data.tree' structure
Convert a a 'party' from the partykit package to a 'data.tree' structure.
Convert a 'phylo' object from the ape package to a 'Node'
Convert an 'rpart' object to a 'data.tree' structure
Convert a 'data.tree' structure to a 'data.frame'
Convert a 'Node' to a 'dendrogram'
Convert a 'data.tree' structure to an igraph network
Convert a 'data.tree' structure to a list-of-list structure
Convert a 'Node' to a phylo object from the ape package.
Calculate the average number of branches each non-leaf has
data.tree: Hierarchical Data Structures
Check if a 'Node' is a leaf
Check if a 'Node' is not a leaf
Check if a 'Node' is not a root
Check if a 'Node' is the root
Sample Data: Data Used by the ID3 Vignette
Print a 'Node' in a human-readable fashion.
Register a method for a suggested dependency