|
|
|
|
|
|
by kemitchell
1935 days ago
|
|
|
> Graphtage matches ordered sequences like lists using an “online”[note], “constructive”[note] implementation of the Levenshtein distance metric[note], similar to the Wagner–Fischer algorithm[note[. The algorithm starts with an unbounded mapping and iteratively improves it until the bounds converge, at which point the optimal edit sequence is discovered. This is implemented in the graphtage.levenshtein module. https://trailofbits.github.io/graphtage/latest/howitworks.ht... So not a tree algo, but an adaptation of a list-diff algo? Or is this just a note on how the tree-diff compares sequences? |
|
|