|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Illustrative example for Manacher's palindrome algorithm. More...
Go to the source code of this file.
Functions | |
| int | main () |
| Demonstrates Manacher's algorithm by computing and printing the longest palindrome in a sample string. | |
Illustrative example for Manacher's palindrome algorithm.
Definition in file manacher_example.cc.
| int main | ( | ) |
Demonstrates Manacher's algorithm by computing and printing the longest palindrome in a sample string.
Prints the input text, the longest palindromic substring found, its starting index, and its length to standard output.
0 indicates successful execution. Definition at line 51 of file manacher_example.cc.
References Aleph::divide_and_conquer_partition_dp(), Aleph::manacher(), and r.