harsh (in C)
harsh (in Haskell)
user-space TCP
The basic idea is you have a start word and end word. You change one letter at a time, each time forming a valid word, moving from the start to the end. For example, from cat to dog, you have the transition cat -> cot -> dot -> dog. This program tries to do that very quickly. It will always build a shortest path, not necessarily the only shortest path. It frees all of the memory it allocates.

This software is available under the public domain.

trans.c was last modified 03/14/2003 12:08pm PST.