powered by
SplitsInBinaryTree() is a convenience function to calculate the number of splits in a fully-resolved (binary) tree with n leaves.
SplitsInBinaryTree()
SplitsInBinaryTree(tree)# S3 method for list SplitsInBinaryTree(tree)# S3 method for multiPhylo SplitsInBinaryTree(tree)# S3 method for numeric SplitsInBinaryTree(tree)# S3 method for `NULL` SplitsInBinaryTree(tree)# S3 method for default SplitsInBinaryTree(tree)# S3 method for Splits SplitsInBinaryTree(tree)# S3 method for phylo SplitsInBinaryTree(tree)
# S3 method for list SplitsInBinaryTree(tree)
# S3 method for multiPhylo SplitsInBinaryTree(tree)
# S3 method for numeric SplitsInBinaryTree(tree)
# S3 method for `NULL` SplitsInBinaryTree(tree)
# S3 method for default SplitsInBinaryTree(tree)
# S3 method for Splits SplitsInBinaryTree(tree)
# S3 method for phylo SplitsInBinaryTree(tree)
SplitsInBinaryTree() returns an integer vector detailing the number of unique non-trivial splits in a binary tree with n leaves.
An object of a supported format that represents a tree or set of trees, from which the number of leaves will be calculated.
Martin R. Smith (martin.smith@durham.ac.uk)
Other tree properties: ConsensusWithout(), MatchEdges(), NSplits(), NTip(), NodeNumbers(), PathLengths(), TipLabels(), TreeIsRooted()
ConsensusWithout()
MatchEdges()
NSplits()
NTip()
NodeNumbers()
PathLengths()
TipLabels()
TreeIsRooted()
Other Splits operations: LabelSplits(), NSplits(), NTip(), PolarizeSplits(), SplitFrequency(), Splits, TipLabels(), TipsInSplits(), match.Splits, xor()
LabelSplits()
PolarizeSplits()
SplitFrequency()
Splits
TipsInSplits()
match.Splits
xor()
tree <- BalancedTree(8) SplitsInBinaryTree(tree) SplitsInBinaryTree(as.Splits(tree)) SplitsInBinaryTree(8) SplitsInBinaryTree(list(tree, tree))
Run the code above in your browser using DataLab