forked from b001io/wagner-fischer
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
13 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,5 +1,17 @@ | ||
# Wanger-Fischer Algorithm | ||
|
||
The [Wagner-Fischer](https://en.wikipedia.org/wiki/Wagner%E2%80%93Fischer_algorithm) algorithm is a dynamic programming algorithm that calculates the Levenshtein distance between two strings of characters. | ||
The [Wagner-Fischer](https://en.wikipedia.org/wiki/Wagner%E2%80%93Fischer_algorithm) algorithm is a dynamic programming algorithm that calculates the Levenshtein distance between two strings of characters. | ||
|
||
### How to run the code | ||
|
||
1. Clone this repository to your local drive. | ||
2. Install Python3 (& pip). | ||
3. Run the following command to see the results: | ||
|
||
``` | ||
python3 wagner-fischer.py | ||
``` | ||
|
||
### Credits | ||
|
||
Algorithm by [boo1](https://github.com/b001io) on [YouTube](https://www.youtube.com/watch?v=d-Eq6x1yssU). |