SDSL: Succinct Data Structure Library
A C++ template library for succinct data structures
|
cst_construct.hpp contains a space and time efficient construction method for compressed suffix trees (cst). More...
#include "int_vector.hpp"
#include "typedefs.hpp"
#include "algorithms_for_suffix_array_construction.hpp"
#include "algorithms_for_compressed_suffix_arrays.hpp"
#include "util.hpp"
#include "testutils.hpp"
#include "lcp_construct.hpp"
#include <iostream>
#include <stdexcept>
Go to the source code of this file.
Namespaces | |
namespace | sdsl |
Namespace for the succinct data structure library. | |
Functions | |
template<class Cst > | |
bool | sdsl::construct_cst (std::string file_name, Cst &cst) |
Constructs a compressed suffix tree (cst) by a semi-external algorithm. | |
template<class Cst > | |
bool | sdsl::construct_cst (std::string file_name, Cst &cst, tMSS &file_map, bool delete_files=true, std::string dir="./", bool build_only_bps=false, std::string id="", std::string lcp_method="any") |
Constructs a compressed suffix tree (cst) semi-external. |
cst_construct.hpp contains a space and time efficient construction method for compressed suffix trees (cst).