Flexible .NET implementation of Eugene Myers diff algorithm.
-
Updated
Sep 7, 2026 - C#
Flexible .NET implementation of Eugene Myers diff algorithm.
Generates a shortest edit script (Myers' diff algorithm) to indicate how to get from the strings in column A to the strings in column B. Also provides the edit distance (levenshtein).
Implementation of Myers’ O(ND) diff algorithm with trace visualization, exact reconstruction, an LCS oracle, and terminal, HTML, and SVG output
To associate your repository with the shortest-edit-script topic, visit your repo's landing page and select "manage topics."