A Dryad job is a graph generator which can synthesize any directed acyclic graph.
Is it practical to store unique paths through a directed acyclic graph?
Algorithm to find a hierarchy tree in a directed acyclic graph?
To solve the difficulty in modeling a chemical system a new node granularity transformation method based on object directed acyclic graph was proposed.
A constructible definition of the directed acyclic graph was described, and the reason why exists a solution that does not exceed the total execution time of all tasks was explained.
