1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40
|
/* sdsl - succinct data structures library
Copyright (C) 2009 Simon Gog
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see http://www.gnu.org/licenses/ .
*/
/*! \file suffix_trees.hpp
\brief suffix_trees.hpp contains generic classes for different suffix tree classes.
\author Simon Gog
*/
#ifndef INCLUDED_SDSL_SUFFIX_TREES
#define INCLUDED_SDSL_SUFFIX_TREES
/** \defgroup cst Compressed Suffix Trees (CST)
* This group contains data structures for compressed suffix trees. The following methods are supported:
* - root()
* - child(v,c)
* - select_child(v)
* - select_leaf(i)
* - parent(v)
* - sl(v)
* - lca(v,w)
* - ..
*/
#include "cst_sct3.hpp"
#include "cst_sada.hpp"
#include "cst_fully.hpp"
#endif
|