Closed PierreBarrat closed 2 years ago
New functions names:
distance(n1::TreeNode, n2::TreeNode; topological=false)
distance(t::Tree, n1::AbstractString, n2::AbstractString; topological=false)
divtime
The topological kwarg counts the number of branches separating two nodes without considering branch length
topological
New functions names:
distance(n1::TreeNode, n2::TreeNode; topological=false)
distance(t::Tree, n1::AbstractString, n2::AbstractString; topological=false)
divtime
for backward compatibilityThe
topological
kwarg counts the number of branches separating two nodes without considering branch length