I’ve been working on a Rust library, and published yesterday, that decomposes general recursion, into three independent parts: * **Tree/Graph** structure (*Nodes* and their child nodes; DAG only) * **Fold** logic (three closures: *initialize* intermediate…