Learn R Programming

Datasmith (version 1.0-1)

Tools to Complete Euclidean Distance Matrices

Description

Implements several algorithms for Euclidean distance matrix completion, Sensor Network Localization, and sparse Euclidean distance matrix completion using the minimum spanning tree.

Copy Link

Version

Install

install.packages('Datasmith')

Monthly Downloads

3

Version

1.0-1

License

GPL-2 | GPL-3

Maintainer

Adam Rahman

Last Published

January 6th, 2017

Functions in Datasmith (1.0-1)

colamdR

Column Approximate Minimum Degree Permutation
mstUB

Shortest Path Upper Bound
edm2psd

Linear Matrix Operator
mst

Compute Minimum Spanning Tree
mstLB

Minimum Spanning Tree Preserving Lower Bound
primPath

Minimum Spanning Tree Path
snl

Sensor Network Localization
rgrs

Relaxed Guided Random Search