I'm building a directed graph library, where the nodes has "out" and "in" fields. If I connect a node, let's say: (node->node n0 n1) then the node's fields would be the following:
n0: in: () out: (n1) n1: in: (n0) out () My problem is that if I update n0 I could only add the old "instance" to the list, so when I update n1, n0's out field would would contain an outdated n1 also.. So n00b head I think it's out of the functional paradigm(or I could use node-ids and a hash as a graph, but I don't like it), but how you guys would solve this problem? Any workaround? Thanks for your help! M -- 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
