Skip to content

kewarrie/wagner-fischer

This branch is 4 commits ahead of b001io/wagner-fischer:main.

Folders and files

NameName
Last commit message
Last commit date

Latest commit

d6c9fde · Jan 28, 2024

History

5 Commits
Jan 27, 2024
Jan 28, 2024
Jan 17, 2024
Jan 17, 2024

Repository files navigation

Wanger-Fischer Algorithm

The Wagner-Fischer 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 on YouTube.

About

W A G N E R F I S C H E R

Resources

Stars

Watchers

Forks

Languages

  • Python 100.0%