Edit the first text field on the left to specify the maximum number of letter transitions (m) and then click on the Read button. A dataset of over 8600 five-letter words in the English language will be read-in and a network will be generated connecting as many words as possible in this dataset. Each word will be a node in the network and there will be a link from one node to another if the first node contains a word that can be transformed into the word in the second node with at most m-letter changes.
Once the network is generated, edit the other two text fields to specify the two words whose shortest-path from one to the other you want. You also have a choice of which algorithm to be used in order to find the shortest-path, either Dijkstra's algorithm or a matrix-based one. Once you have chosen which algorithm to be used through the pull-down list on the far right, click on the Find button.
The results from your request, as well as any status reports issued by the search engine, will be printed in the text area below.