Template Function ADS::greedy

• Defined in File Paradigms.h

Function Documentation

template<class X, class Cand, class Best>
std::vector<X> ADS::greedy(int k, Cand &&candidates, Best &&best)

the greedy scheme: for each of k stages, the best( candidates ) of the values candidates( i , x ) admissible after the partial solution x is appended to x, the stage skipped if there is none