powered by
Methods for calculating a minimum spanning tree or network between a number of points given a distance matrix.
dino.mst(x, random.start = TRUE, random.search = TRUE) dino.msn(x)
a distance matrix for any number of points
If the minimum spanning tree is to start at a random point and not the first given site (default is TRUE)
If there is more than one shortest possible branch, should one be chosen randomly
Returns a binary matrix where connections between points are denoted by a 1.
Ensure that a distance matrix is used, and not a similarity matrix, otherwise the result given will be highly incorrect.
dino.dist
# NOT RUN { #minimum spanning tree for the fdata set data(fdata.mat) fdata.dist<-dino.dist(fdata.mat) dino.mst<-dino.mst(fdata.dist) # }
Run the code above in your browser using DataLab