A dependency graph models relationships between nodes. The graph is directed and asyclic, throwing a circular dependency exception if circular dependencies are added.
Constructs an empty dependency graph.
Adds a node into the dependency graph. If the node already exists within the graph, does nothing.
Adds a dependency between two nodes. If either of the nodes do not exist within the dependency graph, throws an exception.
Returns true if the node exists within the dependency graph.
Returns the adjacent dependent nodes.
Returns an iterator to the dependents of the node.
Returns the nodes within this dependency graph.
Returns a topological sort of this dependency
Returns true if a node has dependents.
Removes the node from the dependency graph. If the node does not exist does nothing.
Returns the number of vertices in the dependency graph.
Returns a string representation of this dependency graph.
Generates a DependenyGraph object from a string representation.
Generated using TypeDoc