00001 /************************************************************************** 00002 * Copyright (c) 2005-2011 T. M. Murali * 00003 * Copyright (c) 2008-2011 Naveed Massjouni * 00004 * Copyright (c) 2004 Greg Grothaus * 00005 * * 00006 * This file is part of Biorithm. * 00007 * * 00008 * Biorithm is free software: you can redistribute it and/or modify * 00009 * it under the terms of the GNU General Public License as published by * 00010 * the Free Software Foundation, either version 3 of the License, or * 00011 * (at your option) any later version. * 00012 * * 00013 * Biorithm is distributed in the hope that it will be useful, * 00014 * but WITHOUT ANY WARRANTY; without even the implied warranty of * 00015 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * 00016 * GNU General Public License for more details. * 00017 * * 00018 * You should have received a copy of the GNU General Public License * 00019 * along with Biorithm. If not, see <http://www.gnu.org/licenses/>. * 00020 * * 00021 **************************************************************************/ 00022 00023 #include<vector> 00024 #include<string> 00025 #include<iostream> 00026 #include<map> 00027 #include "itemset.h" 00028 #include "setTemplates.C" 00029 using namespace std; 00030 00031 #ifndef GREEDYSETCOVER 00032 #define GREEDYSETCOVER 00033 00034 class greedySetCover 00035 { 00036 private: 00037 set<int> computeBase(set<itemset> &); 00038 itemset getMaximal(set<itemset>&,map<int,int>&); 00039 public: 00040 greedySetCover(); 00041 set<itemset> getSetCover(set<itemset>,int); 00042 }; 00043 00044 #endif