Zoltan2::KMeansAlgorithm< IT, WT > Class Template Reference

KMeansAlgorithm Class that performs clustering of the coordinates, and returns the closest set of coordinates. Useful to filter the processors, when there are more processors than needed. More...

#include <Zoltan2_TaskMapping.hpp>

List of all members.

Public Member Functions
	~KMeansAlgorithm ()
	KMeansAlgorithm (int dim_, IT numElements_, WT **elementCoords_, IT required_elements_)
	KMeansAlgorithm Constructor.
void	kmeans ()
void	getMinDistanceCluster (IT *procPermutation)

---

Detailed Description

template<class IT, class WT>
class Zoltan2::KMeansAlgorithm< IT, WT >

KMeansAlgorithm Class that performs clustering of the coordinates, and returns the closest set of coordinates. Useful to filter the processors, when there are more processors than needed.

Definition at line 425 of file Zoltan2_TaskMapping.hpp.

---

Constructor & Destructor Documentation

template<class IT, class WT>

Zoltan2::KMeansAlgorithm< IT, WT >::~KMeansAlgorithm

(

)

[inline]

Definition at line 436 of file Zoltan2_TaskMapping.hpp.

template<class IT, class WT>

Zoltan2::KMeansAlgorithm< IT, WT >::KMeansAlgorithm	(	int	dim_,
		IT	numElements_,
		WT **	elementCoords_,
		IT	required_elements_
	)		[inline]

KMeansAlgorithm Constructor.

Definition at line 444 of file Zoltan2_TaskMapping.hpp.

---

Member Function Documentation

template<class IT, class WT>

void Zoltan2::KMeansAlgorithm< IT, WT >::kmeans

(

)

[inline]

Definition at line 512 of file Zoltan2_TaskMapping.hpp.

template<class IT, class WT>

void Zoltan2::KMeansAlgorithm< IT, WT >::getMinDistanceCluster

(

IT *

procPermutation

)

[inline]

Definition at line 538 of file Zoltan2_TaskMapping.hpp.

---

The documentation for this class was generated from the following file:

• Zoltan2_TaskMapping.hpp