Building asynchronous `future` callback chain from compile-time dependency graph (DAG)
The easiest way is to start from the entry node of the graph, as if you were writing the code by hand. In order to solve the join problem, you can not use a recursive solution, you need to have a topological ordering of your graph, and then build the graph according to the ordering. … Read more