Adds a node as dependency to this node.
Predecessors of the node (other nodes that must come before this one in the topological ordering).
Resets the mutable attributes of the node used in traversal algorithms.
Successor in the topological ordering (None if no order was computed yet).
Class representing a node in a graph, labeled with an instance of class A.