lti::minimumSpanningTreeOfKeytype< K, V, Distantor > Class Template Reference

Computes a minimum spanning tree. More...

#include <ltiMinimumSpanningTreeOfKeytype.h>

Inheritance diagram for lti::minimumSpanningTreeOfKeytype< K, V, Distantor >:

[legend]

Collaboration diagram for lti::minimumSpanningTreeOfKeytype< K, V, Distantor >:

[legend]

List of all members.

Public Types
typedef minimumSpanningTree< K, V, Distantor >::parameters	parameters
typedef minimumSpanningTree< K, V, Distantor >::distance_type	distance_type
typedef minimumSpanningTree< K, V, Distantor >::key_value_type	key_value_type
Public Member Functions
	minimumSpanningTreeOfKeytype ()
	minimumSpanningTreeOfKeytype (const parameters &par)
	minimumSpanningTreeOfKeytype (const minimumSpanningTreeOfKeytype &other)
virtual	~minimumSpanningTreeOfKeytype ()
virtual const char *	getTypeName () const
bool	apply (const matrix< K > &src, const matrix< V > &datas, weightedGraph< K, V, distance_type > &graph) const
minimumSpanningTreeOfKeytype &	copy (const minimumSpanningTreeOfKeytype &other)
minimumSpanningTreeOfKeytype &	operator= (const minimumSpanningTreeOfKeytype &other)
virtual functor *	clone () const
const parameters &	getParameters () const

---

Detailed Description

template<class K, class V = int, class Distantor = l2SquareDistantor<K>>
class lti::minimumSpanningTreeOfKeytype< K, V, Distantor >

Computes a minimum spanning tree.

This class computes a minimum spanning tree from a matrix where each element in the matrix represents one key (data point), e.g. a matrix of rgbPixel (which is an image).

---

Member Typedef Documentation

template<class K , class V = int, class Distantor = l2SquareDistantor<K>>

typedef minimumSpanningTree<K,V,Distantor>::distance_type lti::minimumSpanningTreeOfKeytype< K, V, Distantor >::distance_type

Distance type.

Reimplemented from lti::minimumSpanningTree< K, V, Distantor >.

template<class K , class V = int, class Distantor = l2SquareDistantor<K>>

typedef minimumSpanningTree<K,V,Distantor>::key_value_type lti::minimumSpanningTreeOfKeytype< K, V, Distantor >::key_value_type

Key Value Type.

Reimplemented from lti::minimumSpanningTree< K, V, Distantor >.

template<class K , class V = int, class Distantor = l2SquareDistantor<K>>

typedef minimumSpanningTree<K,V,Distantor>::parameters lti::minimumSpanningTreeOfKeytype< K, V, Distantor >::parameters

This class uses the same parameters as its base class.

---

Constructor & Destructor Documentation

template<class K , class V = int, class Distantor = l2SquareDistantor<K>>

lti::minimumSpanningTreeOfKeytype< K, V, Distantor >::minimumSpanningTreeOfKeytype

(

)

default constructor

template<class K , class V = int, class Distantor = l2SquareDistantor<K>>

lti::minimumSpanningTreeOfKeytype< K, V, Distantor >::minimumSpanningTreeOfKeytype

(

const parameters &

par

)

Construct a functor using the given parameters.

template<class K , class V = int, class Distantor = l2SquareDistantor<K>>

lti::minimumSpanningTreeOfKeytype< K, V, Distantor >::minimumSpanningTreeOfKeytype

(

const minimumSpanningTreeOfKeytype< K, V, Distantor > &

other

)

copy constructor

Parameters:

other

the object to be copied

template<class K , class V = int, class Distantor = l2SquareDistantor<K>>

virtual lti::minimumSpanningTreeOfKeytype< K, V, Distantor >::~minimumSpanningTreeOfKeytype

(

)

[virtual]

destructor

---

Member Function Documentation

template<class K , class V = int, class Distantor = l2SquareDistantor<K>>

bool lti::minimumSpanningTreeOfKeytype< K, V, Distantor >::apply	(	const matrix< K > &	src,
		const matrix< V > &	datas,
		weightedGraph< K, V, distance_type > &	graph
	)			const

computes the minimum spanning tree of the given data in matrix

Parameters:

	src	the data that is used for building
	datas	data set
	graph	the tree will be returned here.

Returns:

true if apply successful or false otherwise.

template<class K , class V = int, class Distantor = l2SquareDistantor<K>>

virtual functor* lti::minimumSpanningTreeOfKeytype< K, V, Distantor >::clone

(

)

const [virtual]

returns a pointer to a clone of this functor.

Reimplemented from lti::minimumSpanningTree< K, V, Distantor >.

template<class K , class V = int, class Distantor = l2SquareDistantor<K>>

minimumSpanningTreeOfKeytype& lti::minimumSpanningTreeOfKeytype< K, V, Distantor >::copy

(

const minimumSpanningTreeOfKeytype< K, V, Distantor > &

other

)

copy data of "other" functor.

Parameters:

other

the functor to be copied

Returns:

a reference to this functor object

Reimplemented from lti::minimumSpanningTree< K, V, Distantor >.

template<class K , class V = int, class Distantor = l2SquareDistantor<K>>

const parameters& lti::minimumSpanningTreeOfKeytype< K, V, Distantor >::getParameters

(

)

const

returns used parameters

Reimplemented from lti::minimumSpanningTree< K, V, Distantor >.

template<class K , class V = int, class Distantor = l2SquareDistantor<K>>

virtual const char* lti::minimumSpanningTreeOfKeytype< K, V, Distantor >::getTypeName

(

)

const [virtual]

returns the name of this type ("minimumSpanningTreeOfKeytype")

Reimplemented from lti::minimumSpanningTree< K, V, Distantor >.

template<class K , class V = int, class Distantor = l2SquareDistantor<K>>

minimumSpanningTreeOfKeytype& lti::minimumSpanningTreeOfKeytype< K, V, Distantor >::operator=

(

const minimumSpanningTreeOfKeytype< K, V, Distantor > &

other

)

alias for copy member

Parameters:

other

the functor to be copied

Returns:

a reference to this functor object

Reimplemented from lti::minimumSpanningTree< K, V, Distantor >.

---

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

• ltiMinimumSpanningTreeOfKeytype.h