JGraph TDependency Graph
This class offers an implementation of a dependency graph, namely a data structure which can address in an efficient way the problem of finding those reactions affected by the execution of another reaction. This class relies heavily on the ReactionHandler interface.
Parameters
Functions
This method creates the dependencies when a new reaction is added to the environment. Please be careful when building the environment and populating the existing reactions map: this method assumes that all the dependencies among the existing reactions are correct and up to date.
Returns the set of reactions that may be influenced by the provided reaction.
This method removes all the dependencies (both in and out dependencies) for a given reaction handler. This method is meant to be used to keep the dependencies clean when removing a reaction.
Given two nodes, the engine assumes they are no longer neighbors and deletes the neighborhood dependencies between them.