mst: Compute Minimum Spanning Tree

In great-northern-diver/edmcr: Euclidean Distance Matrix Completion Tools

Description

mst Compute a minimum spanning tree using Prim's algorithm

Usage

mst(D)

Arguments

D	A distance matrix

Value

MST a data frame object of 3 columns containing the parent nodes, child nodes, and corresponding weight of the MST edge

Examples

X <- runif(10,0,1)
Y <- runif(10,0,1)
D <- dist(cbind(X,Y))

mst(as.matrix(D))

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