There is a very good article
(http://www.norvig.com/spell-correct.html) by Peter Norvig on the
subject.
On 7/30/09, Vikram Sridar vikramsridar...@gmail.com wrote:
Use Tries...
They are kinda binary trees specially equipped to handle dictionary
applications
On 6/20/07, mirchi [EMAIL PROTECTED] wrote:
can anyone please tell me how to find
single source longest path in a directed acyclic graph??
If all edges are non-negative, you can use Dijkstra's Algorithm. Otherwise a
simple Bellman-Ford should do. But if you are looking for something
