mstUB: Shortest Path Upper Bound
In great-northern-diver/edmcr: Euclidean Distance Matrix Completion Tools

mstUB Compute the shortest path upper bound for all unknown entries in a partial distance matrix

mstUB(A)

`A`	A (connected) partial distance matrix, with unknown entries set to Inf

This function uses the shortest.paths() function, available in the igraph package.

UB A matrix containing the upper bounds for only the unknown entries. All other entries will be set to Inf.

1 2	A <- dist(cbind(rnorm(10,0,1),rnorm(10,0,1))) mstUB(as.matrix(A))

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