Order of each node in a tree
NodeOrder() calculates the number of edges incident to each node in a tree.
Includes the root edge in rooted trees.
NodeOrder(x, includeAncestor = TRUE, internalOnly = FALSE)
x |
A tree of class |
includeAncestor |
Logical specifying whether to count edge leading to ancestral node in calculation of order. |
internalOnly |
Logical specifying whether to restrict to results
to internal nodes, i.e. to omit leaves. Irrelevant if
|
NodeOrder() returns an integer listing the order of each node;
entries are named with the number of each node.
Martin R. Smith (martin.smith@durham.ac.uk)
Other tree navigation:
AncestorEdge(),
CladeSizes(),
DescendantEdges(),
EdgeAncestry(),
EdgeDistances(),
ListAncestors(),
MRCA(),
NDescendants(),
NodeDepth(),
NonDuplicateRoot(),
RootNode()
tree <- CollapseNode(BalancedTree(8), 12:15) NodeOrder(tree) plot(tree) nodelabels(NodeOrder(tree, internalOnly = TRUE))
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.