David J. Pearce and Paul H. J. Kelly.
|
A dynamic topological sort algorithm for directed acyclic graphs.
|
ACM Journal of Experimental Algorithms, 11, 2006.
|
Fields inherited from class choco.kernel.common.opres.graph.GraphDTC |
ADDED, CYCLE, EXISTING, index, INTERNAL_ERROR, n, nbEdges, predecessors, successors, TRANSITIVE, transitiveArcAdded |
Methods inherited from class choco.kernel.common.opres.graph.GraphDTC |
acceptTransitiveArcs, getN, getNbEdges, getNbPredecessors, getNbSuccessors, getPredecessors, getSuccessors, hasPredecessor, hasSuccessor, isDisconnected, isEmpty, isNotTransitive, isTransitive, meld, setAcceptTransitiveArcs, toDotty, toDotty, toTreeNodeMatrix |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
DagTODTC
public DagTODTC(int n)
- Parameters:
n
-
fireTopologicalorder
protected void fireTopologicalorder(int i,
int j)
- Overrides:
fireTopologicalorder
in class DagDTC
Copyright © 2012. All Rights Reserved.