[.net] Implementation of Diff or Levenshtein Distance algorithm for text Comparer
Author
Does anybody ever implement a text comparer algorithm like Windiff or Visual Safe Code application?
I have found an algorithm called Levenshtein Distance. But I don't know how to implement it in Visual C# or C++. Does anybody ever use this algorithm?
I am looking for text and binary diff algorithms. It would be helpful if you point me to some sources - how to implement a one (algorithm) or source code.
Thank you very much.
Quote:Original post by chrisliando
Have you ever implement this method?
I did once, when I was in school, years ago. Never had the need since then, as it's often implemented in most languages.
Quote:Do you have any code sample?
I do not have any code sample, because it's been years since I wrote it, and it was on a school computer anyway. However, if you had followed my link, you would have noticed that the first line in the section was a link to a C# implementation.
This topic is closed to new replies.
Advertisement
Popular Topics
Advertisement
