|
This program will depart from a user-specified word in any of its supported languages, turn it into another valid word by replacing, deleting or adding one letter, and then repeat that process until a given target word is reached (if at all possible). The lowest number of operations needed is calculated, and all possible paths of that length are returned. The program may also be used to choose a path of unspecified length at random. A third possibility is to let Wordjumper use the start word also as its target word; in that case, it will run through all links of the entire network without repeating itself. Optionally, the program will only consider words of the same length (i. e., it will not add or delete letters).
Q & A
|