| 
    dignea
    1.0.0
    
   Diverse Instance Generator with Novelty Search and Evolutionary Algorithms 
   | 
 
Search algorithm interface for dignea. Use this class as the skeleton to define local or other types of searches. More...
#include <Search.h>
  
Public Member Functions | |
| Search ()=default | |
| Constructs a default Search.  | |
| virtual vector< S > | run (vector< S > &population, const Problem< S > *prob)=0 | 
| Perform a search over a population.  More... | |
| virtual Front< S > | getResults ()=0 | 
| Returns a Front of solutions. Use this method for searches that must keep track of solutions or run several times.  More... | |
Search algorithm interface for dignea. Use this class as the skeleton to define local or other types of searches.
| S | 
Returns a Front of solutions. Use this method for searches that must keep track of solutions or run several times.
Implemented in NoveltySearch< S >.
      
  | 
  pure virtual | 
Perform a search over a population.
| population | Population of individuals to take as the starting point | 
| prob | Raw pointer to the problem being solved | 
Implemented in NoveltySearch< S >.