'A' Longest Common Subsequence (LCS) implementation
0
I found myself wanting to do a Linux style diff of a graph (directed acyclic) in C++. In digging around I found the Longest Common Subsequence algorithm (dating back to 1974!). I decided to understand it by implementing a version in C++. This is a C++ template implementation which works under some constraints.
| Languages | C++ |
There was an error parsing the reST source, the error message was:
string indices must be integers, not str
Add a Comment