class to solve shortest superstring 3.5 aproximation, using greedy algorithm: contract pair of words with largest overlap until one word stays
#include <shortest_superstring.hpp>
Public Types | |
typedef range_to_elem_t< Words > | Word |
typedef range_to_elem_t< Word > | Letter |
Public Member Functions | |
shortest_superstring (const Words &words) | |
Word | get_solution () |
return word contains all words as subwords, of lenght at most 3.5 larger than shortest superstring. More... | |
class to solve shortest superstring 3.5 aproximation, using greedy algorithm: contract pair of words with largest overlap until one word stays
example file is shortest_superstring_example.cpp
Words |
Definition at line 48 of file shortest_superstring.hpp.
|
inline |
return word contains all words as subwords, of lenght at most 3.5 larger than shortest superstring.
example file is shortest_superstring_example.cpp
Definition at line 82 of file shortest_superstring.hpp.