No description, website, or topics provided.
Clone or download
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
screenshots Update to version 1.1. Jan 5, 2019
LICENSE Initial commit Dec 31, 2018
Levenshtein.pro First commit. Dec 31, 2018
README.md Update to version 1.1. Jan 5, 2019
main.cpp First commit. Dec 31, 2018
mainwindow.cpp Update to version 1.1. Jan 5, 2019
mainwindow.h Update to version 1.1. Jan 5, 2019
mainwindow.ui Update to version 1.1. Jan 5, 2019

README.md

Levenshtein distance

Detailed description.

Simply program to ilustrate how does Levenshtein distance algorithm work. Put two strings and press button START. When you click NEXT button, you can see next step of algorithm. Last modified cell in table have yellow background color. The smallest values given to the last modified cell have a green background color. Another checked cells have red background color. Check "Calculate everything at once" if you dont want press "Next" button many times to get result.

Requirements.

To build and run this program, you need a libary Qt 5.12 and operating system Windows 7/10 or GNU/Linux. I have unknow problem to run this application under Windows 8. Program was tested under MinGW compiler on Windows and under GCC 64-bit on Linux(Ubuntu 18.04.1 LTS).

Screenshots.

Window1 Window2

Download.

Download the newest version for Microsoft Windows 7 and 10: https://github.com/arkadiusz97/Levenshtein-distance/releases/download/1.1/bin_Levenshtein.zip