KrisLibrary  1.0.0
CoverSet.h
1 #ifndef UTIL_MUXSET_H
2 #define UTIL_MUXSET_H
3 
4 #include <vector>
5 using namespace std;
6 
18 vector<bool> CalculateCoverset_BruteForce(const vector<vector<bool> >& sets);
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);
22 
36 vector<int> CalculateSetCover_Greedy(const vector<vector<bool> >& sets);
37 
38 
39 #endif
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