Detail of Greedy namespace. More...
Classes | |
struct | sched_traits |
class | compare |
struct | set_data_type |
class | selector |
class | prefix_tree |
class | shortest_superstring |
class to solve shortest superstring 3.5 aproximation, using greedy algorithm: contract pair of words with largest overlap until one word stays
#include <iostream>
#include <string>
int main() {
std::vector<std::string> words({ "ba", "ab", "aa", "bb" });
std::cout << paal::greedy::shortestSuperstring(words) << std::endl;
}
| |
Typedefs | |
template<typename SetReference , typename GetElementsOfSet , typename GetWeightOfElement > | |
using | element_weight_t = pure_result_of_t< GetWeightOfElement(range_to_elem_t< pure_result_of_t< GetElementsOfSet(SetReference)>>)> |
template<typename SetRange , typename GetCostOfSet > | |
using | set_range_cost_t = pure_result_of_t< GetCostOfSet(typename boost::range_reference< SetRange >::type)> |
Variables | |
const int | UNCOVERED = -1 |
Detail of Greedy namespace.