Levenshtein distance/Alignment: Difference between revisions

for ( uint64_t i = 1; i <= a.length(); ++i ) {

costs[i][0] = i;

costs[i][j] = std::min(std::min( costs[i - 1][j], costs[i][j - 1]) + 1,

a[i - 1] == b[j - 1] ? costs[i - 1][j - 1] : costs[i - 1][j - 1] + 1);