I have used mutable code working on Java structures when I was implementing the kind of Dijkstra algorithm. As long as it is encapsulated in a function it seems quite a good approach to me.
And also quite readable given the amount of mutable Dijkstra examples in the Internet. -- 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
