|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Illustrative example for LCS and Longest Common Substring. More...
Go to the source code of this file.
Functions | |
| int | main () |
| Example program demonstrating longest_common_subsequence and longest_common_substring. | |
Illustrative example for LCS and Longest Common Substring.
Definition in file lcs_longest_common_substring_example.cc.
| int main | ( | ) |
Example program demonstrating longest_common_subsequence and longest_common_substring.
Prints two sample input strings and the results from computing their longest common subsequence and a longest common substring (including lengths, substring value, and begin indices) to standard output.
Definition at line 52 of file lcs_longest_common_substring_example.cc.
References Aleph::divide_and_conquer_partition_dp(), Aleph::longest_common_subsequence(), and Aleph::longest_common_substring().