angel
mercurial changeset:
|
Simulates vertex elimination heuristics with edge eliminations. More...
#include <heuristics.hpp>
Public Member Functions | |
emulated_vertex_heuristic_t (Vertex_heuristic_t _h) | |
Constructor stores the vertex-based heuristic to be used. | |
int | operator() (const vector< edge_ij_elim_t > &tv1, const c_graph_t &cg, vector< edge_ij_elim_t > &tv2) |
Private Attributes | |
Vertex_heuristic_t | h |
c_graph_t::vertex_t | last_vertex |
Simulates vertex elimination heuristics with edge eliminations.
Egde eliminations belonging to one vertex elimination are executed successively. Can be applied to c-graphs containing dependents with out-degree > 0. If multiple vertex heuristics are used it is better to combine them first and to derive and edge heuristic from it than combining the derived edge heuristics.
Definition at line 1082 of file heuristics.hpp.
angel::emulated_vertex_heuristic_t< Vertex_heuristic_t >::emulated_vertex_heuristic_t | ( | Vertex_heuristic_t | _h | ) | [inline] |
Constructor stores the vertex-based heuristic to be used.
Definition at line 1087 of file heuristics.hpp.
int angel::emulated_vertex_heuristic_t< Vertex_heuristic_t >::operator() | ( | const vector< edge_ij_elim_t > & | tv1, |
const c_graph_t & | cg, | ||
vector< edge_ij_elim_t > & | tv2 | ||
) |
Definition at line 67 of file heuristics_impl.hpp.
Vertex_heuristic_t angel::emulated_vertex_heuristic_t< Vertex_heuristic_t >::h [private] |
Definition at line 1083 of file heuristics.hpp.
c_graph_t::vertex_t angel::emulated_vertex_heuristic_t< Vertex_heuristic_t >::last_vertex [private] |
Definition at line 1084 of file heuristics.hpp.