Flexible .NET implementation of Eugene Myers diff algorithm.
-
Updated
Dec 30, 2024 - C#
#
shortest-edit-script
Here are 2 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).
-
Updated
Oct 15, 2024 - Rust
Improve this page
Add a description, image, and links to the shortest-edit-script topic page so that developers can more easily learn about it.
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."