sdsl-lite/tutorial/expl-21.cpp at master · diffoperator/sdsl-lite · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
#include<sdsl/suffix_trees.hpp>
#include<iostream>

usingnamespacesdsl;
usingnamespacestd;

intmain()
{
 cst_sct3<> cst;
construct_im(cst, "umulmundumulmum", 1);
 cout << "inner nodes : " << cst.nodes() - cst.csa.size() << endl;
auto v = cst.select_child(cst.child(cst.root(), 'u'),1);
auto d = cst.depth(v);
 cout << "v : " << d << "-[" << cst.lb(v) << "," << cst.rb(v) << "]" << endl;
 cout << "extract(cst, v) : " << extract(cst, v) << endl;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
#include<sdsl/suffix_trees.hpp>
#include<iostream>

usingnamespacesdsl;
usingnamespacestd;

intmain()
{
 cst_sct3<> cst;
construct_im(cst, "umulmundumulmum", 1);
 cout << "inner nodes : " << cst.nodes() - cst.csa.size() << endl;
auto v = cst.select_child(cst.child(cst.root(), 'u'),1);
auto d = cst.depth(v);
 cout << "v : " << d << "-[" << cst.lb(v) << "," << cst.rb(v) << "]" << endl;
 cout << "extract(cst, v) : " << extract(cst, v) << endl;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
#include<sdsl/suffix_trees.hpp>
#include<iostream>

usingnamespacesdsl;
usingnamespacestd;

intmain()
{
 cst_sct3<> cst;
construct_im(cst, "umulmundumulmum", 1);
 cout << "inner nodes : " << cst.nodes() - cst.csa.size() << endl;
auto v = cst.select_child(cst.child(cst.root(), 'u'),1);
auto d = cst.depth(v);
 cout << "v : " << d << "-[" << cst.lb(v) << "," << cst.rb(v) << "]" << endl;
 cout << "extract(cst, v) : " << extract(cst, v) << endl;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
#include<sdsl/suffix_trees.hpp>
#include<iostream>

usingnamespacesdsl;
usingnamespacestd;

intmain()
{
 cst_sct3<> cst;
construct_im(cst, "umulmundumulmum", 1);
 cout << "inner nodes : " << cst.nodes() - cst.csa.size() << endl;
auto v = cst.select_child(cst.child(cst.root(), 'u'),1);
auto d = cst.depth(v);
 cout << "v : " << d << "-[" << cst.lb(v) << "," << cst.rb(v) << "]" << endl;
 cout << "extract(cst, v) : " << extract(cst, v) << endl;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
#include<sdsl/suffix_trees.hpp>
#include<iostream>

usingnamespacesdsl;
usingnamespacestd;

intmain()
{
 cst_sct3<> cst;
construct_im(cst, "umulmundumulmum", 1);
 cout << "inner nodes : " << cst.nodes() - cst.csa.size() << endl;
auto v = cst.select_child(cst.child(cst.root(), 'u'),1);
auto d = cst.depth(v);
 cout << "v : " << d << "-[" << cst.lb(v) << "," << cst.rb(v) << "]" << endl;
 cout << "extract(cst, v) : " << extract(cst, v) << endl;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
#include<sdsl/suffix_trees.hpp>
#include<iostream>

usingnamespacesdsl;
usingnamespacestd;

intmain()
{
 cst_sct3<> cst;
construct_im(cst, "umulmundumulmum", 1);
 cout << "inner nodes : " << cst.nodes() - cst.csa.size() << endl;
auto v = cst.select_child(cst.child(cst.root(), 'u'),1);
auto d = cst.depth(v);
 cout << "v : " << d << "-[" << cst.lb(v) << "," << cst.rb(v) << "]" << endl;
 cout << "extract(cst, v) : " << extract(cst, v) << endl;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
#include<sdsl/suffix_trees.hpp>
#include<iostream>

usingnamespacesdsl;
usingnamespacestd;

intmain()
{
 cst_sct3<> cst;
construct_im(cst, "umulmundumulmum", 1);
 cout << "inner nodes : " << cst.nodes() - cst.csa.size() << endl;
auto v = cst.select_child(cst.child(cst.root(), 'u'),1);
auto d = cst.depth(v);
 cout << "v : " << d << "-[" << cst.lb(v) << "," << cst.rb(v) << "]" << endl;
 cout << "extract(cst, v) : " << extract(cst, v) << endl;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
#include<sdsl/suffix_trees.hpp>
#include<iostream>

usingnamespacesdsl;
usingnamespacestd;

intmain()
{
 cst_sct3<> cst;
construct_im(cst, "umulmundumulmum", 1);
 cout << "inner nodes : " << cst.nodes() - cst.csa.size() << endl;
auto v = cst.select_child(cst.child(cst.root(), 'u'),1);
auto d = cst.depth(v);
 cout << "v : " << d << "-[" << cst.lb(v) << "," << cst.rb(v) << "]" << endl;
 cout << "extract(cst, v) : " << extract(cst, v) << endl;
}