Non-duplicate root
Identify, for each edge, whether it denotes a different partition from
the root edge.
The first edge of the input tree must be a root edge; this can be
accomplished using Preorder()
.
NonDuplicateRoot(parent, child, nEdge = length(parent))
parent |
Integer vector corresponding to the first column of the edge
matrix of a tree of class |
child |
Integer vector corresponding to the second column of the edge
matrix of a tree of class |
nEdge |
(optional) integer specifying the number of edges of a tree of
class |
This function is deprecated; if you use it, please comment (#32) so that a suitable replacement can be guaranteed.
NonDuplicateRoot()
returns a logical vector of length nEdge
,
specifying TRUE
unless an edge identifies the same partition as
the root edge.
Martin R. Smith (martin.smith@durham.ac.uk)
Other tree navigation:
AncestorEdge()
,
CladeSizes()
,
DescendantEdges()
,
EdgeAncestry()
,
EdgeDistances()
,
ListAncestors()
,
MRCA()
,
NDescendants()
,
NodeDepth()
,
NodeOrder()
,
RootNode()
tree <- Preorder(BalancedTree(8)) edge <- tree$edge parent <- edge[, 1] child <- edge[, 2] which(!NonDuplicateRoot(parent, child))
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.