For those tracking, ... thanks to help from you all,
I've now implemented a demo showing the PersistentHeap in action for a-star search, instantiated for the 15-puzzle: http://code.google.com/p/jc-pheap/source/browse/#svn/trunk/jc-pheap/src/clj_algorithms . I hope to tackle an efficient Dijkstra's algorithm, next, to show off the decreaseKey() (actually called changeVal()), followed by Branch-and-bound, and, finally parallel branch-and-bound. When I get to branch-and-bound, I have more cool operations planned for the heap, too, such as an efficient way to prune the heap based on the bounding function to save memory. one thing I'm interested in knowing is, looking at a-star, should I have a function in the heap that returns the min data/priority as a pair? It's not likely to be faster, but it could feel more convenient. If that's the case, what should be the container for the pair to make it work nicely with clojure? feedback invited. should some or all of this work turn into a contrib? The AI part ... the heap part ... both? Thanks. - Eli --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en -~----------~----~----~----~------~----~------~--~---
