Graph Geodesic between leaves of unweighted tree
Value
GraphGeodesic() returns an unnamed integer matrix describing the
number of edges between each pair of edges.
Author
Martin R. Smith, modifying algorithm by Emmanuel Paradis
in ape::dist.nodes().
Examples
GraphGeodesic(TreeTools::BalancedTree(5))
#> [,1] [,2] [,3] [,4] [,5]
#> [1,] 0 2 3 5 5
#> [2,] 2 0 3 5 5
#> [3,] 3 3 0 4 4
#> [4,] 5 5 4 0 2
#> [5,] 5 5 4 2 0