-
Notifications
You must be signed in to change notification settings - Fork 1
countrodrigo/Levenshtein-Puzzle
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
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 0
No packages published