edit distance.. On Mon, Jul 12, 2010 at 10:22 AM, Anil Kumar S. R. <sra...@gmail.com> wrote:
> Use the A* Search approach, which is based on a function f(x) = g(x) + > h(x), where f(x) is > the total cost, g(x) is the cost to travel to the current node and h(x) is > the heuristic > estimate of the cost remaining to the goal, from the current node. Use the > hamming distance > approach to find h(x), which specifies how much two words differ. > > Use the data structures such as hash table and min priority queue to > compute f(x). > > Anil Kumar S. R. > > "The best way to succeed in this world is to act on the advice you give to > others." > > > > On 11 July 2010 08:21, sharad kumar <sharad20073...@gmail.com> wrote: > >> @jalaj >> how u make graph >> so that we can apply dijkasta algo >> plzzzzz xpalain >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algoge...@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@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 algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- With Regards Ankur Aggarwal -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
