Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
lcs_longest_common_substring_example.cc File Reference

Illustrative example for LCS and Longest Common Substring. More...

#include <iostream>
#include <string>
#include <String_DP.H>
Include dependency graph for lcs_longest_common_substring_example.cc:

Go to the source code of this file.

Functions

int main ()
 Example program demonstrating longest_common_subsequence and longest_common_substring.
 

Detailed Description

Illustrative example for LCS and Longest Common Substring.

Definition in file lcs_longest_common_substring_example.cc.

Function Documentation

◆ main()

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.

Returns
int Exit code 0 on successful execution.

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().