Man pages for Datasmith
Tools to Complete Euclidean Distance Matrices
| colamdR | Column Approximate Minimum Degree Permutation |
| dpf | Dissimilarity Parameterization Formulation |
| edm2gram | Linear Matrix Operator |
| edm2psd | Linear Matrix Operator |
| getConfig | Create a Point Configuration from a Distance Matrix |
| gram2edm | Linear Matrix Operator |
| grs | Guided Random Search |
| mst | Compute Minimum Spanning Tree |
| mstLB | Minimum Spanning Tree Preserving Lower Bound |
| mstUB | Shortest Path Upper Bound |
| npf | Nonparametric Position Formulation |
| primPath | Minimum Spanning Tree Path |
| psd2edm | Linear Matrix Operator |
| rgrs | Relaxed Guided Random Search |
| sdp | Semi-Definite Programming Algorithm |
| snl | Sensor Network Localization |
