This is more like a graph traversal problem. All the dictionary words form the nodes, strings who differ by one digit have edges between them. What is the shortest path from Node "map" to Node "man". Here it will be 1 as man and map have a edge between them.
Karthik R, R&D Engineer, Tejas Networks. On Tue, Aug 30, 2011 at 11:25 AM, Anup Ghatage <ghat...@gmail.com> wrote: > Possibly a case of finding the longest common sub-sequence and then doing > the insertions/deletions etc > or AKA Levenshtein distance / Edit Distance > -- > Anup Ghatage > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
