cst_fully.hpp File Reference

cst_fully.hpp contains an implementation of Russo et al. More...

#include <sdsl/bit_vectors.hpp>
#include <sdsl/bp_support.hpp>
#include <sdsl/construct.hpp>
#include <sdsl/cst_iterators.hpp>
#include <sdsl/cst_sada.hpp>
#include <sdsl/sdsl_concepts.hpp>
#include <sdsl/suffix_arrays.hpp>
#include <sdsl/suffix_tree_algorithm.hpp>
#include <sdsl/suffix_tree_helper.hpp>
#include <sdsl/util.hpp>
#include <sdsl/vectors.hpp>

Go to the source code of this file.

Classes
class	sdsl::lcp_fully< t_cst >
class	sdsl::cst_fully< t_csa, t_delta, t_s_support, t_b, t_depth, t_sample_leaves >
	A class for the Fully-Compressed Suffix Tree (FCST) proposed by Russo et al. More...

Namespaces
namespace	sdsl
	Namespace for the succinct data structure library.

Detailed Description

cst_fully.hpp contains an implementation of Russo et al.

's Fully-Compressed Suffix Tree.

Author

Christian Ocker, Simon Gog

Definition in file cst_fully.hpp.