Package generic.algorithms


package generic.algorithms
  • Classes
    Class
    Description
     
    Lcs<T>
    Abstract class for finding the Longest Common Subsequence (LCS) between two sequences of Matchable objects, x and y.
    Calculates the longest common subsequence (LCS) between two sequences of Matchable objects, x and y.
    An implementation of the ReducingLcs that takes as its input a list of <T>items, where the list is the 'sequence' being checked for the Longest Common Subsequence.