Description Usage Arguments Details Value Author(s) See Also Examples
Methods for calculating a minimum spanning tree or network between a number of points given a distance matrix.
1 2 |
x |
a distance matrix for any number of points |
random.start |
If the minimum spanning tree is to start at a random point and not the first given site (default is TRUE) |
random.search |
If there is more than one shortest possible branch, should one be chosen randomly |
Ensure that a distance matrix is used, and not a similarity matrix, otherwise the result given will be highly incorrect.
Returns a binary matrix where connections between points are denoted by a 1.
Yvonnick Noel, Julien Claude and Emmanuel Paradis with modifications from Matthew Vavrek
1 2 3 4 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.