19 vector<bool> CalculateCoverset_Incremental(
const vector<vector<bool> >& sets);
20 vector<bool> CalculateCoverset_IncrementalSorted(
const vector<vector<bool> >& sets);
21 vector<bool> CalculateCoverset_Greedy(
const vector<vector<bool> >& sets);
Definition: rayprimitives.h:132
vector< bool > CalculateCoverset_BruteForce(const vector< vector< bool > > &sets)
Calculate a minimal subset of items that has a non-empty intersection with each of the given sets...
Definition: CoverSet.cpp:110
vector< int > CalculateSetCover_Greedy(const vector< vector< bool > > &sets)
Picks the smallest subset of the given sets that covers the whole space.
Definition: CoverSet.cpp:302