On Thu, Oct 4, 2012 at 8:46 PM, David Nolen <dnolen.li...@gmail.com> wrote:
> On Mon, Oct 1, 2012 at 9:13 AM, Reinout Stevens <reste...@vub.ac.be>wrote: > >> Hi, >> >> >> I quickly changed the code so that the graph structure no longer contains >> the list of nodes, and the same behaviour still persists. For the actual >> implementation I have changed it to a function that returns a list of >> nodes, which can be compared in O(1) instead of looping over the data >> structure, and also here we get the same behaviour. >> >> Personally, I don't see the difference between calling solve-goal or >> solve-goals, as both should have an equally large table. The recursive step >> of solve-goals shouldn't do anything, as we are only passing a list >> containing a single item. In attachment the updated code (aka: just removed >> the :node key from the graph). >> >> >> Thanks for taking your time and looking into this, >> >> >> Reinout >> > > Still digging into this. Thanks for running that quick test. You're right, > it is still taking a long time - and nothing even gets added to the goal's > table! So the slowdown is coming from elsewhere ... > > David > Oops spoke a bit too soon. The goal table is in fact growing in a very strange way ... David -- 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
