angel
mercurial changeset:
|
Minimizes the maximal distance of vertices involved in an edge elimination The motivation is that for small distances it is not very probable to re-insert one of new edges later. More...
#include <heuristics.hpp>
Public Member Functions | |
minimal_distance_edge_t () | |
int | operator() (const vector< edge_bool_t > &ev1, const c_graph_t &cg, vector< edge_bool_t > &ev2) |
Minimizes the maximal distance of vertices involved in an edge elimination The motivation is that for small distances it is not very probable to re-insert one of new edges later.
Definition at line 757 of file heuristics.hpp.
Definition at line 759 of file heuristics.hpp.
int angel::minimal_distance_edge_t::operator() | ( | const vector< edge_bool_t > & | ev1, |
const c_graph_t & | cg, | ||
vector< edge_bool_t > & | ev2 | ||
) |
Definition at line 838 of file heuristics.cpp.
References angel::standard_heuristic_op().