Clojurians Log v2

It works well when the graph is actually an unweighted tree with all child nodes being Clojure collections or scalar values inside parent collections. And when your pre/post-walk functions need to know only the value at the current node, regardless of any details of the path to that node. In other words, plenty of limitations when it comes to graphs in general but a very nice library when it comes to nested data structures where each datum can be processed in isolation.

Cool, thank you!

slightly off topic, but I have found that when doing work immutable graphs, converting to adjacency list format makes things much simpler. especially when the graph is cyclic

Yeah, I think that's kind of what I am implicitly doing in my model

I was just wondering whether that's actually a good idea, but it seems my intuition hasn't been completely off there

If you'll excuse the shameless plug, I wrote a library a while back that you might find interesting: https://github.com/ont-app/igraph .