Computation / Dependency Graph Validation and Pruning

Requirements This task has two closely connected interpretations. Form A: General-purpose graph manager Create a compact graph interface with the following methods: Validation may be responsible for checking all of the following: Every node referenced by an edge has been inserted. The directed graph contains no cycle. A dependency is scheduled before the node that consumes it. Any required input and output nodes exist. The graph obeys its required structural conditions. Form…