dignea  1.0.0
Diverse Instance Generator with Novelty Search and Evolutionary Algorithms
Search< S > Class Template Referenceabstract

Search algorithm interface for dignea. Use this class as the skeleton to define local or other types of searches. More...

#include <Search.h>

Inheritance diagram for Search< S >:
NoveltySearch< S > NSFeatures< S > NSPerformance< S >

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...
 

Detailed Description

template<typename S>
class Search< S >

Search algorithm interface for dignea. Use this class as the skeleton to define local or other types of searches.

Template Parameters
S

Member Function Documentation

◆ getResults()

template<typename S >
virtual Front<S> Search< S >::getResults ( )
pure virtual

Returns a Front of solutions. Use this method for searches that must keep track of solutions or run several times.

Returns
Front of solutions found

Implemented in NoveltySearch< S >.

◆ run()

template<typename S >
virtual vector<S> Search< S >::run ( vector< S > &  population,
const Problem< S > *  prob 
)
pure virtual

Perform a search over a population.

Parameters
populationPopulation of individuals to take as the starting point
probRaw pointer to the problem being solved
Returns
New population of solutions

Implemented in NoveltySearch< S >.


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