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 |

`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 |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.