On Fri, Oct 26, 2012 at 4:16 AM, Tassilo Horn <t...@gnu.org> wrote: > Any ideas and pointers how to implement that? >
I don't really see anyway to do this without the graph itself being a relational data structure. I haven't seen any data structure that fits that bill beyond lists (which of course can be used to build others). > I think this should be doable with a deftype with mutable fields. Then > my relations would emit a final instance of this type (or modify a given > instance) with the known properties set (e.g., typeo sets the type > field, vertexo sets the kind fild to vertex, valueo sets an entry of > some attributes map, etc). > You can't put mutable things into core.logic because of backtracking. I don't see any obvious way to make this work beyond converting the graph into a list and running your query on that. 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
