# Teitz-Bart algorithm applied to a 'raw' distance matrix

### Description

Teitz-Bart algorithm applied to a 'raw' distance matrix

### Usage

1 |

### Arguments

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

### Value

Set of point indices for *p*-median (may be local optimum)

### Examples

1 2 3 4 |

Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker. Vote for new features on Trello.