primPath: Minimum Spanning Tree Path
In great-northern-diver/edmcr: Euclidean Distance Matrix Completion Tools

primPath Given a starting node, creates the minimum spanning tree path through a point configuration.

1	primPath(A, start)

`A`	the distance matrix for which the minimum spanning tree path will be created
`start`	the starting node for the path

Given a starting node, compute Prim's algorithm, resulting in the path taken to construct the minimum spanning tree.

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.

1
2
3

A <- dist(cbind(rnorm(100,0,1),rnorm(100,0,1)))
primPath(as.matrix(A),1)
primPath(as.matrix(A),2)

great-northern-diver/edmcr documentation built on Dec. 20, 2021, 12:52 p.m.

great-northern-diver/edmcr index

Note that we can't provide technical support on individual packages. You should contact the package authors for that.

Description