Distributed dynamic graph .

[jvmlet]

First of all - thanks for such an interesting library. Question : imagine distributed system in which trees are born dynamically on several nodes. Tree branches might overlap (branch of tree A is basicly a tree B), or tree C shares the branch of tree D. Trees A, B, C and D compose distributed graph. Does API allow to plugi-n/support distributed locking of evaluation of nodes? Distributed notification of completion event? Basically, I'm after the integration of this library and masstransit saga pattern implementation. Is it possible to modify the tree (insert node in the middle ) dynamically? What about persisting the graph definition?