|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Illustrative example for the naive compressed suffix tree. More...
Go to the source code of this file.
Functions | |
| int | main () |
| Example program demonstrating construction and queries on a Naive_Suffix_Tree for the string "banana". | |
Illustrative example for the naive compressed suffix tree.
Definition in file suffix_tree_example.cc.
| int main | ( | ) |
Example program demonstrating construction and queries on a Naive_Suffix_Tree for the string "banana".
Constructs a Naive_Suffix_Tree from "banana", prints the input text and node count, checks whether the pattern "ana" is contained in the text, and prints all match starting positions to standard output.
Definition at line 52 of file suffix_tree_example.cc.
References Aleph::divide_and_conquer_partition_dp(), Aleph::Naive_Suffix_Tree::find_all(), and Aleph::Naive_Suffix_Tree::node_count().