sdsl/include/sdsl/cst_sct3.hpp File Reference

cst_sct3.hpp contains an implementation of an compressed suffix tree (CST). More...

#include "int_vector.hpp"
#include "algorithms.hpp"
#include "iterators.hpp"
#include "lcp_support_tree.hpp"
#include "lcp_wt.hpp"
#include "bp_support.hpp"
#include "csa_wt.hpp"
#include "csa_uncompressed.hpp"
#include "cst_iterators.hpp"
#include "cst_sct.hpp"
#include "rank_support.hpp"
#include "select_support.hpp"
#include "testutils.hpp"
#include "util.hpp"
#include <iostream>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iterator>
#include <stack>
#include <ostream>

Go to the source code of this file.

Classes
struct	sdsl::bp_interval< Int >
class	sdsl::cst_sct3< Csa, Lcp, Bp_support, Rank_support >
	A class for the Compressed Suffix Tree (CST) proposed by Ohlebusch and Gog. More...
Namespaces
namespace	sdsl
	Namespace for the succinct data structure library.
Functions
template<class Int >
std::ostream &	sdsl::operator<< (std::ostream &os, const bp_interval< Int > &interval)

---

Detailed Description

cst_sct3.hpp contains an implementation of an compressed suffix tree (CST).

Author:

Simon Gog