dignea  1.0.0
Diverse Instance Generator with Novelty Search and Evolutionary Algorithms
Search.h
1 //
2 // Created by amarrero on 18/6/21.
3 //
4 
5 #ifndef DIGNEA_SEARCH_H
6 #define DIGNEA_SEARCH_H
7 
8 #include <dignea/core/Front.h>
9 #include <dignea/core/Problem.h>
10 #include <dignea/core/Solution.h>
11 
12 #include <vector>
13 
14 using namespace std;
15 
22 template <typename S>
23 class Search {
24  public:
26  Search() = default;
27 
28  virtual ~Search() = default;
34  virtual vector<S> run(vector<S> &population, const Problem<S> *prob) = 0;
38  virtual Front<S> getResults() = 0;
39 };
40 
41 #endif // DIGNEA_SEARCH_H
Front
Front class which stores the final results of an EA execution.
Definition: Front.h:26
Problem
Class to represent a Problem in the tool. It includes the basic information for a problem a few metho...
Definition: Problem.h:29
Search
Search algorithm interface for dignea. Use this class as the skeleton to define local or other types ...
Definition: Search.h:23
Search::run
virtual vector< S > run(vector< S > &population, const Problem< S > *prob)=0
Perform a search over a population.
Search::getResults
virtual Front< S > getResults()=0
Returns a Front of solutions. Use this method for searches that must keep track of solutions or run s...
Search::Search
Search()=default
Constructs a default Search.