Is there a better-than-brute-force algorithm to generate a graph whose relation is string edit...
Channel: Roel Van de Paar
Date: 2021-02-28

Is there a better-than-brute-force algorithm to generate a graph whose relation is string edit distance=1?

Helpful?  Please support me on Patreon: https://www.patreon.com/roelvandepaar

With thanks & praise to God, and with thanks to the many people who have made this project possible! | Content (except music & images) licensed under CC BY-SA https://meta.stackexchange.com/help/licensing | Music: https://www.bensound.com/licensing | Images: https://stocksnap.io/license & others | With thanks to user Vladislav Bezhentsev (cs.stackexchange.com/users/119535), user Silvan Mosberger (cs.stackexchange.com/users/87000), user Juho (cs.stackexchange.com/users/472), user Galen (cs.stackexchange.com/users/103313), and the Stack Exchange Network (cs.stackexchange.com/questions/124376). Trademarks are property of their respective owners. Disclaimer: All information is provided "AS IS" without warranty of any kind. You are responsible for your own actions. Please contact me if anything is amiss at Roel D.OT VandePaar A.T gmail.com