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