List ancestors
ListAncestors() reports all ancestors of a given node.
ListAncestors(parent, child, node = NULL) AllAncestors(parent, child)
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 |
node |
Integer giving the index of the node or tip whose ancestors are
required, or |
Note that if node = NULL, the tree's edges must be listed such that each
internal node (except the root) is listed as a child before it is listed
as a parent, i.e. its index in child is less than its index in parent.
This will be true of trees listed in Preorder.
If node = NULL, ListAncestors() returns a list. Each entry i contains
a vector containing, in order, the nodes encountered when traversing the tree
from node i to the root node.
The last entry of each member of the list is therefore the root node,
with the exception of the entry for the root node itself, which is a
zero-length integer.
If node is an integer, ListAncestors() returns a vector of the numbers of
the nodes ancestral to the given node, including the root node.
AllAncestors: Alias for ListAncestors(node = NULL).
Martin R. Smith (martin.smith@durham.ac.uk)
Martin R. Smith (martin.smith@durham.ac.uk)
Implemented less efficiently in phangorn:::Ancestors, on which this
code is based.
Other tree navigation:
AncestorEdge(),
CladeSizes(),
DescendantEdges(),
EdgeAncestry(),
EdgeDistances(),
MRCA(),
NDescendants(),
NodeDepth(),
NodeOrder(),
NonDuplicateRoot(),
RootNode()
Other tree navigation:
AncestorEdge(),
CladeSizes(),
DescendantEdges(),
EdgeAncestry(),
EdgeDistances(),
MRCA(),
NDescendants(),
NodeDepth(),
NodeOrder(),
NonDuplicateRoot(),
RootNode()
tree <- PectinateTree(5)
edge <- tree$edge
# Identify desired node with:
plot(tree)
nodelabels()
tiplabels()
# Ancestors of specific nodes:
ListAncestors(edge[, 1], edge[, 2], 4L)
ListAncestors(edge[, 1], edge[, 2], 8L)
# Ancestors of each node, if tree numbering system is uncertain:
lapply(seq_len(max(edge)), ListAncestors,
parent = edge[, 1], child = edge[, 2])
# Ancestors of each node, if tree is in preorder:
ListAncestors(edge[, 1], edge[, 2])
# Alias:
AllAncestors(edge[, 1], edge[, 2])Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.