Skip to content

Code to find all words within a Levenshtein distance of one from a seed word, recursively.

Notifications You must be signed in to change notification settings

countrodrigo/Levenshtein-Puzzle

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 

Repository files navigation

Determine the extended social network of a word. A word's friends
are those words within a Levenshtein distance of 1, and	its extended network
encompasses its friends, friend's friends, etc.

About

Code to find all words within a Levenshtein distance of one from a seed word, recursively.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published