angel::minimal_distance_edge_t Class Reference

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>

Inheritance diagram for angel::minimal_distance_edge_t:

[legend]

Collaboration diagram for angel::minimal_distance_edge_t:

[legend]

List of all members.

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)

---

Detailed Description

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 749 of file heuristics.hpp.

---

Constructor & Destructor Documentation

angel::minimal_distance_edge_t::minimal_distance_edge_t

(

)

[inline]

Definition at line 751 of file heuristics.hpp.

---

Member Function Documentation

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 830 of file heuristics.cpp.

References angel::standard_heuristic_op().

Here is the call graph for this function:

---

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

• angel/include/heuristics.hpp
• angel/src/heuristics.cpp

---