shortest_superstring.hpp File Reference

#include "paal/utils/algorithms/suffix_array/lcp.hpp"
#include "paal/utils/algorithms/suffix_array/suffix_array.hpp"
#include "paal/utils/type_functions.hpp"
#include "paal/greedy/shortest_superstring/prefix_tree.hpp"
#include "paal/data_structures/bimap.hpp"
#include "paal/utils/irange.hpp"
#include <boost/range/adaptors.hpp>
#include <vector>
#include <algorithm>
#include <utility>
#include <type_traits>

Go to the source code of this file.

Classes
class	paal::greedy::detail::shortest_superstring< Words >
	class to solve shortest superstring 3.5 aproximation, using greedy algorithm: contract pair of words with largest overlap until one word stays #include "paal/greedy/shortest_superstring/shortest_superstring.hpp" #include <iostream> #include <string> int main() { std::vector<std::string> words({ "ba", "ab", "aa", "bb" }); std::cout << paal::greedy::shortestSuperstring(words) << std::endl; } More...

Namespaces
	paal
	global namespace of project.
	paal::greedy
	Greedy namespace.
	paal::greedy::detail
	Detail of Greedy namespace.

Functions
template<typename Words >
auto	paal::greedy::shortestSuperstring (const Words &words) -> decltype(std::declval< detail::shortest_superstring< Words >>().get_solution())
	detail More...

Detailed Description

Author

Piotr Smulewicz

Version

1.0

Date

2013-08-29

Definition in file shortest_superstring.hpp.