Public Member Functions | Protected Attributes | Private Attributes | List of all members
SceneModel::AbstractHeuristic Class Reference

#include <AbstractHeuristic.h>

Inheritance diagram for SceneModel::AbstractHeuristic:
Inheritance graph
[legend]

Public Member Functions

 AbstractHeuristic (std::string pDescription)
 
virtual void apply (std::vector< boost::shared_ptr< TreeNode > > pNodes)
 
virtual void apply (std::vector< boost::shared_ptr< TreeNode > > pNodes, boost::shared_ptr< TreeNode > pChild)
 
virtual boost::shared_ptr< TreeNodegetBestCluster ()
 
virtual boost::shared_ptr< TreeNodegetBestParentNode ()
 
bool operator< (const AbstractHeuristic &heuristic) const
 
void reset ()
 
virtual ~AbstractHeuristic ()
 

Protected Attributes

std::vector< boost::shared_ptr< TreeNode > > candidates
 
double score
 

Private Attributes

std::string mDescription
 

Detailed Description

An abstract interface for a clustering heuristic used to create clusters for building the tree.

Author
Joachim Gehrung
Version
See SVN

Definition at line 36 of file AbstractHeuristic.h.

Constructor & Destructor Documentation

SceneModel::AbstractHeuristic::AbstractHeuristic ( std::string  pDescription)

Constructor.

Parameters
pDescriptionDescription of the heuristic.

Definition at line 22 of file AbstractHeuristic.cpp.

SceneModel::AbstractHeuristic::~AbstractHeuristic ( )
virtual

Destructor.

Definition at line 28 of file AbstractHeuristic.cpp.

Member Function Documentation

void SceneModel::AbstractHeuristic::apply ( std::vector< boost::shared_ptr< TreeNode > >  pNodes)
virtual

Applies the heuristic to the trajectory set.

Parameters
pNodesThe set of nodes containing the trajectories that this heuristic should be applied to.

Reimplemented in SceneModel::DirectionRelationHeuristic.

Definition at line 33 of file AbstractHeuristic.cpp.

void SceneModel::AbstractHeuristic::apply ( std::vector< boost::shared_ptr< TreeNode > >  pNodes,
boost::shared_ptr< TreeNode pChild 
)
virtual

Applies the heuristic to the trajectory set, specifies the child node.

Parameters
pNodesThe set of nodes containing the trajectories that this heuristic should be applied to.
pChildThe node that should act as child node.

Reimplemented in SceneModel::DirectionRelationHeuristic.

Definition at line 38 of file AbstractHeuristic.cpp.

boost::shared_ptr< TreeNode > SceneModel::AbstractHeuristic::getBestCluster ( )
virtual

Returns the best cluster found by the heuristic.

Returns
The best cluster found.

Reimplemented in SceneModel::DirectionRelationHeuristic.

Definition at line 43 of file AbstractHeuristic.cpp.

boost::shared_ptr< TreeNode > SceneModel::AbstractHeuristic::getBestParentNode ( )
virtual

Returns the best parent node calculated for the node specified before.

Returns
The best parent node found

Reimplemented in SceneModel::DirectionRelationHeuristic.

Definition at line 49 of file AbstractHeuristic.cpp.

bool SceneModel::AbstractHeuristic::operator< ( const AbstractHeuristic heuristic) const

Operator overwrite for heuristic comparison.

Definition at line 61 of file AbstractHeuristic.cpp.

void SceneModel::AbstractHeuristic::reset ( )

Resets the heuristic.

Definition at line 55 of file AbstractHeuristic.cpp.

Member Data Documentation

std::vector<boost::shared_ptr<TreeNode> > SceneModel::AbstractHeuristic::candidates
protected

A list of candidates for the best cluster.

Definition at line 106 of file AbstractHeuristic.h.

std::string SceneModel::AbstractHeuristic::mDescription
private

Description of the heuristic.

Definition at line 95 of file AbstractHeuristic.h.

double SceneModel::AbstractHeuristic::score
protected

The score for the best cluster.

Definition at line 101 of file AbstractHeuristic.h.


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


asr_relation_graph_generator
Author(s): Meißner Pascal
autogenerated on Fri Nov 15 2019 03:39:19