Timeline for Hamming Distance using a dictionary
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 7, 2015 at 23:21 | comment | added | Alexus | Execution path will rarely be shortest distance, however the output you provide should be. That's why I am saying to keep track of nodes you have visited to avoid loops. Also, keep track of nodes that successfully let you navigate closer to your target word. If you find dead end, go back and remove the success nodes from the second list up to the moment where you still have options to explore further. If no options are left, it's a dead end. Binary tree obviously doesn't work, as you have non-binary tree here. | |
| Jul 7, 2015 at 23:14 | comment | added | Siqi Liu | Actually if you try to do depth search, you don't get the shortest distance. Going breadth search might work, but how would I implement a tree-traversal algorithm? Binary trees don't work. | |
| Jul 7, 2015 at 18:47 | history | answered | Alexus | CC BY-SA 3.0 |