27 std::vector<std::pair<int, int>> centers,
28 vertices = { { 0, 0 }, { 1, 1 }, { 0, 5 }, { 2, 6 } };
32 vertices.end(), back_inserter(centers))
metric with euclidean distance
int main()
[K Center Example]
data_structures::metric_traits< Metric >::DistanceType kCenter(const Metric &metric, unsigned int numberOfClusters, const ItemIterator iBegin, const ItemIterator iEnd, OutputIterator result)
this is solve K Center problem and return radius example: