Checks that node have correct reference to each othe.
Checks that node have correct reference to each othe. Nodes are expected to know their successors and predecessors. This is expected to be consistent between several nodes.
performs a self-check on the ordering, use for testing
performs a self-check on the ordering, use for testing
sorts DAG nodes according to dependencies.
sorts DAG nodes according to dependencies. first position is set to zero. this throws an exception CycleException in case a cycle is detected
the autosort status
to notify that an edge has been added between two nodes.
to notify that an edge has been added between two nodes. this will trigger a re-ordering of the nodes in the topological sort if it is activated. The reordering might lead to an exception CycleException in case there is a cycle in the graph We expect the graph to be updated prior to calling this method notice that you do not need to notify edge deletion.
turns the incremental sort on or off.
turns the incremental sort on or off. Incremental sort is then applied at each edge insert. node insert and delete is prohibited when autosort is activated in case a cycle is detected, does not pass in autosort model, but throws an exception