On Monday, May 21, 2012 7:11:01 AM UTC-4, Martin Jul wrote: > > Symbolic computation sounds like a really great project! > > For your specific problem of sorting the dependencies, you can do a > "topological sort" of the dependency graph of your equations in linear time > (given there are no cyclic dependencies, otherwise it would detect the > failure). There are standard algorithms to do that. > > I ended up coding my own hand solution but I started from the leaves and worked towards the root nodes. I'll try the topological sort + reverse list approach and then compare performances. The topological sort code looks much simpler.
-- 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
