[EMAIL PROTECTED] a écrit :
> For those that understand algorithms and can talk Python, I want to
> convert the Python code in the section "Reading out all LCSs" into C++
> code but I don't understand some of the syntax. Can anyone give me a
> hand?
>
> def backTrackAll(C, X, Y, i, j):
> if i
On Nov 13, 12:51 pm, Neil Cerutti <[EMAIL PROTECTED]> wrote:
> On 2007-11-13, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
>
>
>
> > On Nov 13, 9:28 am, [EMAIL PROTECTED] wrote:
> >> I am working on an implementation of the Longest Common
> >> Subsequence problem (as I understand it, this problem c
On 2007-11-13, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
> On Nov 13, 9:28 am, [EMAIL PROTECTED] wrote:
>> I am working on an implementation of the Longest Common
>> Subsequence problem (as I understand it, this problem can be
>> used in spell checking type activities) and have used this
>> site
On Nov 13, 9:28 am, [EMAIL PROTECTED] wrote:
> I am working on an implementation of the Longest Common Subsequence
> problem (as I understand it, this problem can be used in spell
> checking type activities) and have used this site to understand the
> problem and its solution:
>
> http://en.wikiboo
