Re:Fun with Clojure: Turning Cats into Dogs in Hanoi
by merraksh on Sunday October 03, 2010 @04:15PM
(#1753497)
This can be cast as a shortest path problem. Implementations on huge graphs (several million nodes), i.e. larger than the one defined by a dictionary, are very efficient and usually take advantage of both the source and destination rather than just performing breadth first search from the source. I can think of Andrew Goldberg's work, see e.g.
Re:Fun with Clojure: Turning Cats into Dogs in Hanoi
by jkkramer on Sunday October 03, 2010 @04:39PM
(#1753550)
Thanks for the Goldberg pointer. I have a rudimentary bidirectional, parallel BFS working which I'll be blogging about once it's ready. It runs very fast even on huge graphs.
http://research.microsoft.com/en-us/people/goldberg/