I came across this article : http://maryrosecook.com/blog/post/the-fibonacci-heap-ruins-my-life
The user says that he can not use fibonacci heaps efficiently in clojure because since the memory location of nodes changes, it is not possible to have a pointer to the nodes to get faster access to them. This is important in Dijkstra algorithm of shortest distance because you have to change the value/keys of nodes. Changing values and reshuffling is fast in fibonacci heaps. But for that you need accesss to the node. This is easy in c++ but not that in clojure . How can we achieve the same thing ? Can we have some more tweaks to Fib-Heaps to make it happen in clojure ? any other alternative data structure ? -- 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 Note that posts from new members are moderated - please be patient with your first post. 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 --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
