#include <eoDominanceMap.h>
Inheritance diagram for eoDominanceMap< EoType >:

Public Member Functions | |
| void | clear () |
| Clears the map. | |
| void | operator() (const eoPop< EoType > &_pop) |
| Update or create the dominance map. | |
| void | remove (unsigned i) |
| Removes the domination info for a given individual, thus nothing dominates it and it dominates nothing. | |
| void | setup (const eoPop< EoType > &_pop) |
| Create domination matrix from scratch. | |
| std::vector< double > | sum_dominators () const |
| For all elements, returns the no. | |
| std::vector< double > | sum_dominants () const |
| For all elements, returns the number of elements that the element dominates Thus: higher is better It returns a std::vector<double> cuz that makes subsequent manipulation that much easier. | |
Private Attributes | |
| std::vector< typename EoType::Fitness > | fitness |
It is set up such that
if map[i][j] == true then i dominates j
The dominance map can be used to perform pareto ranking (eoParetoRanking) or non dominated sorting. For the latter, the remove() member function might come in handy.
Definition at line 47 of file eoDominanceMap.h.
|
||||||||||
|
Create domination matrix from scratch. Complexity O(N^2) Definition at line 81 of file eoDominanceMap.h. Referenced by eoDominanceMap< EOT >::operator()(). |
|
|||||||||
|
For all elements, returns the no. of elements that dominate the element Thus: lower is better (and 0 is the front). It returns a std::vector<double> cuz that makes subsequent manipulation that much easier Definition at line 118 of file eoDominanceMap.h. Referenced by eoParetoRanking< EOT >::calculate_worths(). |
1.3.9.1