powered by
primPath Given a starting node, creates the minimum spanning tree path through a point configuration.
primPath
primPath(A, start)
the distance matrix for which the minimum spanning tree path will be created
the starting node for the path
return a 2x(n-1) matrix, where row 1 contains the parent nodes of the MST path, and row 2 contains the corresponding child nodes.
Given a starting node, compute Prim's algorithm, resulting in the path taken to construct the minimum spanning tree.
# NOT RUN { A <- dist(cbind(rnorm(100,0,1),rnorm(100,0,1))) primPath(as.matrix(A),1) primPath(as.matrix(A),2) # }
Run the code above in your browser using DataLab