Clojurians Log v2

is it possible to do a "guided" recursion in Pathom? I'm doing pathfinding among points in 3-space, which would be a straightforward A* in an undirected graph, but there are difficulties. • the maximum distance between connected nodes is an input • so the graph is not fixed • it's also huge, 2.5M nodes and even if the max distance were fixed at a moderate value there would be 400M edges or more so I've got a resolver to get the reachable set for any point, and I have an A* search with a pluggable neighbours-fn (though that's negotiable if another interface is better). the naive approach I have in mind is to have my path-between resolver pass neighbours-fn as a closure over its Pathom env that calls p.eql/process internally. I'm not sure whether that's actually broken if eg. I'm using resolver caching, or it works but there's a better way, or if that's totally a chill thing. I know there's recursive resolvers but this is a cycle-tastic graph not a DAG or tree, so that doesn't seem to fit.