angel::lmmd_vertex_t Class Reference

Class for lowest Markowitz with minimal damage in vertex elimination. More...

#include <heuristics.hpp>

Inheritance diagram for angel::lmmd_vertex_t:

Inheritance graph
Collaboration diagram for angel::lmmd_vertex_t:

Collaboration graph

List of all members.

Public Member Functions

 lmmd_vertex_t (double w)
 Weight is set in the constructor.
int operator() (const vector< c_graph_t::vertex_t > &vv1, const c_graph_t &cg, vector< c_graph_t::vertex_t > &vv2)

Private Attributes

double weight

Detailed Description

Class for lowest Markowitz with minimal damage in vertex elimination.

It searches for vertices with minimal sum of Markowitz degree and weighted damaged. The damage of a vertex's elimination is defined as the increase of Markowitz degrees of all other vertices.

Definition at line 194 of file heuristics.hpp.

Constructor & Destructor Documentation

angel::lmmd_vertex_t::lmmd_vertex_t ( double  w  )  [inline]

Weight is set in the constructor.

Definition at line 198 of file heuristics.hpp.

Member Function Documentation

int angel::lmmd_vertex_t::operator() ( const vector< c_graph_t::vertex_t > &  vv1,
const c_graph_t cg,
vector< c_graph_t::vertex_t > &  vv2 

Heuristic computed in operator

vv1 Set of vertices that can be eliminated
cg c-graph
vv2 Set of vertices with lowest lmmd-value
Size of vv2

Definition at line 330 of file heuristics.cpp.

References angel::standard_heuristic_op(), and weight.

Here is the call graph for this function:

Member Data Documentation

double angel::lmmd_vertex_t::weight [private]

Definition at line 195 of file heuristics.hpp.

Referenced by operator()().

The documentation for this class was generated from the following files:
Generated on Wed Mar 11 10:34:51 2009 for angel by  doxygen 1.5.3