sdsl/include/sdsl/cst_sct.hpp File Reference

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

#include "int_vector.hpp"
#include "algorithms.hpp"
#include "iterators.hpp"
#include "lcp_support_sada.hpp"
#include "bp_support.hpp"
#include "csa_wt.hpp"
#include "csa_uncompressed.hpp"
#include "cst_iterators.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::lcp_interval< Int >
	A struct for the representation of an lcp-interval . More...
class	sdsl::cst_sct< Csa, Lcp, Bp_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 lcp_interval< Int > &interval)

---

Detailed Description

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

Author:

Simon Gog