Browse › Articles › 'A' Longest Common Subsequence (LCS) implementation › History › Revision 14 vs. Revision 15

Explain yourself with reStructured Text, embedded code, graphs, charts, and LaTeX–style math. Join Siafoo Now or Learn More

'A' Longest Common Subsequence (LCS) implementation

Revision 14 vs. Revision 15

r14	r15
90	90	Section 2.2 C++ version (first try)
91	91	***********************************
92	92
93	93	The next thing I decided to do was think about this in terms of the sequence being any object. As a result I would need to think more about indices and what it meant to be at the end of a set of objects and the size of the object collection. That was too much to think about so I decided to make an LCS C++ template class that could be used for c++ containers or at least some containers. The code is here ``:snippet:`375``` and test/example code is here ``:snippet:`382```.
94	94
	95	Chapter 3 What else?
	96	---------------------
95	97
96
97		Chapter 3 What else?
98		---------------------
	98	At this point comes the meat of my problem. I want to compare two graphs. I've not read any literature about that (yet) but am considering the following way of doing things. At each node in the graph implementation I am using.