Bial::ClusteringIFT< C, D > Class Template Reference

#include <ClusteringIFT.hpp>

Inheritance diagram for Bial::ClusteringIFT< C, D >:

Collaboration diagram for Bial::ClusteringIFT< C, D >:

Public Member Functions
	ClusteringIFT (C< D > &value, PathFunction< C, D > *function, const Matrix< size_t > &uniform_adjacency, const size_t uniform_adjs, const Vector< Vector< size_t > > &variable_adjacency, const Vector< bool > *seed=nullptr, C< int > *label=nullptr, C< int > *predecessor=nullptr, bool sequential_label=false, long double bucket_size=1.0, bool fifo_tie=true)
	IFT clustering used by Knn OPF method. More...
	ClusteringIFT (C< D > &value, PathFunction< C, D > *function, const Vector< Vector< size_t > > &variable_adjacency, const Vector< size_t > &variable_adjs, const Vector< bool > *seed=nullptr, C< int > *label=nullptr, C< int > *predecessor=nullptr, bool sequential_label=false, long double bucket_size=1.0, bool fifo_tie=true)
	IFT clustering used by LSH OPF method. More...
void	Run ()
	Runs degenerated IFT. More...
Public Member Functions inherited from Bial::DegeneratedIFT< C, D >
	DegeneratedIFT (C< D > &value_image, PathFunction< C, D > *function, const Vector< bool > *seed=nullptr, C< int > *label=nullptr, C< int > *predecessor=nullptr, bool sequential_label=false, long double bucket_size=1.0, bool fifo_tie=true)
	Constructor. Depending on the provided maps, propagation function is different. More...
	~DegeneratedIFT ()
	Destructor. Destroys the bucket queue. More...
void	Run ()
	Runs degenerated IFT. More...

Additional Inherited Members
Protected Member Functions inherited from Bial::DegeneratedIFT< C, D >
BucketQueue *	Initialize (C< D > &value, PathFunction< C, D > *function, const Vector< bool > *seed, C< int > *label, C< int > *predecessor, bool sequential_label, long double bucket_size, bool fifo_tie)
	Initialization of all IFT functions. More...
Protected Attributes inherited from Bial::DegeneratedIFT< C, D >
BucketQueue *	queue
	Degenerated IFT attributes. More...
C< D > &	value
PathFunction< C, D > *	function
const Vector< bool > *	seed
C< int > *	label
C< int > *	predecessor
bool	sequential_label
long double	bucket_size
bool	fifo_tie
PathFunction< C, D >::RemoveFn	RemoveData
PathFunction< C, D >::UpdateFn	UpdateData

Detailed Description

template<template< class D > class C, class D>
class Bial::ClusteringIFT< C, D >

Definition at line 23 of file ClusteringIFT.hpp.

Constructor & Destructor Documentation

template<template< class D > class C, class D >

Bial::ClusteringIFT< C, D >::ClusteringIFT	(	C< D > &	value,
		PathFunction< C, D > *	function,
		const Matrix< size_t > &	uniform_adjacency,
		const size_t	uniform_adjs,
		const Vector< Vector< size_t > > &	variable_adjacency,
		const Vector< bool > *	seed = nullptr,
		C< int > *	label = nullptr,
		C< int > *	predecessor = nullptr,
		bool	sequential_label = false,
		long double	bucket_size = 1.0,
		bool	fifo_tie = true
	)

IFT clustering used by Knn OPF method.

Date

2012/Sep/19

Parameters

value	Value map used in path propagation. It contains the input and output values.
function	Function used to initialize and propagate values.
uniform_adjacency	fixed number of neighbors adjacency.
uniform_adjs	Number of uniform adjacents to be used. The matrix may contain more.
variable_adjacency	variable number of neighbors adjacency.
seed	A boolean Vector indicating the seeds.
label	label map.
predecessor	predecessor map.
bucket_size	Size of a bucket in the bucket queue.
fifo_tie	true for fifo tiebreak, and false for lifo tiebreak.

Returns

none.

Warning

Label, and predecessor maps are optional. Must specify at least one of the adjacencies.

template<template< class D > class C, class D >

Bial::ClusteringIFT< C, D >::ClusteringIFT	(	C< D > &	value,
		PathFunction< C, D > *	function,
		const Vector< Vector< size_t > > &	variable_adjacency,
		const Vector< size_t > &	variable_adjs,
		const Vector< bool > *	seed = nullptr,
		C< int > *	label = nullptr,
		C< int > *	predecessor = nullptr,
		bool	sequential_label = false,
		long double	bucket_size = 1.0,
		bool	fifo_tie = true
	)

IFT clustering used by LSH OPF method.

Date

2012/Sep/19

Parameters

value	Value map used in path propagation. It contains the input and output values.
function	Function used to initialize and propagate values.
variable_adjacency	variable number of neighbors adjacency.
variable_adjs	Number of variable adjacents to be used. The matrix may contain more.
seed	A boolean Vector indicating the seeds.
label	label map.
predecessor	predecessor map.
bucket_size	Size of a bucket in the bucket queue.
fifo_tie	true for fifo tiebreak, and false for lifo tiebreak.

Returns

none.

Warning

Label, and predecessor maps are optional. Must specify at least one of the adjacencies.

Member Function Documentation

template<template< class D > class C, class D >

void Bial::ClusteringIFT< C, D >::Run

(

)

Runs degenerated IFT.

Date

2012/Sep/19

Parameters

none.

Returns

none.

Warning

none.

---

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

• bial/inc/ClusteringIFT.hpp