Flexible .NET implementation of Eugene Myers diff algorithm.
-
Updated
Sep 19, 2026 - C#
#
shortest-edit-script
Here are 3 public repositories matching this topic...
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). Maintained at https://codeberg.org/proycon/sesdiff and https://git.sr.ht/~proycon/sesdiff instead of on Github.
-
Updated
Oct 15, 2024 - Rust
Implementation of Myers’ O(ND) diff algorithm with trace visualization, exact reconstruction, an LCS oracle, and terminal, HTML, and SVG output
-
Updated
Aug 9, 2026 - Rust
Add this topic to your repo
To associate your repository with the shortest-edit-script topic, visit your repo's landing page and select "manage topics."