Description Usage Arguments Value Examples
Teitz-Bart algorithm applied to a 'raw' distance matrix
1 |
d |
- A distance matrix (not necessarily Euclidean) |
guess |
- a guess at the set of p points constituting the p-median |
verbose |
- if TRUE print out each swap in the algorithm (default is FALSE) |
Set of point indices for p-median (may be local optimum)
1 2 3 4 |
Loading required package: Rcpp
Loading required package: sp
[1] 67 73
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.