angel::lmmd_edge_t Class Reference

Class for lowest Markowitz with minimal damage in mixed edge elimination. More...

#include <heuristics.hpp>

Inheritance diagram for angel::lmmd_edge_t:

Inheritance graph
[legend]
Collaboration diagram for angel::lmmd_edge_t:

Collaboration graph
[legend]

List of all members.

Public Member Functions

 lmmd_edge_t (double w)
 Weight is set in the constructor.
int operator() (const vector< edge_bool_t > &ev1, const c_graph_t &cg, vector< edge_bool_t > &ev2)

Private Attributes

double weight


Detailed Description

Class for lowest Markowitz with minimal damage in mixed edge elimination.

It searches for edges with minimal sum of Markowitz degree and weighted damaged. The damage of a edge's elimination is defined as the increase of Markowitz degrees of all other edges. Note that this values can be different for front and back elimination

Definition at line 643 of file heuristics.hpp.


Constructor & Destructor Documentation

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

Weight is set in the constructor.

Definition at line 647 of file heuristics.hpp.


Member Function Documentation

int angel::lmmd_edge_t::operator() ( const vector< edge_bool_t > &  ev1,
const c_graph_t cg,
vector< edge_bool_t > &  ev2 
)

Heuristic computed in operator

Parameters:
ev1 Set of edges that can be eliminated
cg c-graph
ev2 Set of edges with lowest lmmd-value
Returns:
Size of vv2

Definition at line 690 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_edge_t::weight [private]

Definition at line 644 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:57 2009 for angel by  doxygen 1.5.3