, including all inherited members.
| addEdge(DoubleLinkedDAGNode from, DoubleLinkedDAGNode to) | utils.DoubleLinkedDAG | [inline] |
| addNode(DoubleLinkedDAGNode node) | utils.DoubleLinkedDAG | [inline] |
| clone() | utils.DoubleLinkedDAG | [inline] |
| computeMaxDistance(DoubleLinkedDAGNode fromNode, DoubleLinkedDAGNode toNode) | utils.DoubleLinkedDAG | [inline] |
| computeMaxPathLen() | utils.DoubleLinkedDAG | [inline] |
| computeMaxPathLen_Recursive(DoubleLinkedDAGNode root) | utils.DoubleLinkedDAG | [inline, protected] |
| computeMinDistance(DoubleLinkedDAGNode fromNode, DoubleLinkedDAGNode toNode) | utils.DoubleLinkedDAG | [inline] |
| computeTransitiveClosure(boolean computeMinMaxDist) | utils.DoubleLinkedDAG | [inline] |
| correctTransitiveClosure(GraphMatrix transClosure, boolean checkMinMaxDist) | utils.DoubleLinkedDAG | [inline] |
| DoubleLinkedDAG() | utils.DoubleLinkedDAG | [inline] |
| DoubleLinkedDAG(DoubleLinkedDAG dag) | utils.DoubleLinkedDAG | [inline] |
| findCycle() | utils.DoubleLinkedDAG | [inline] |
| findCycle_Recursive(DoubleLinkedDAGNode n, ArrayList foundCycle) | utils.DoubleLinkedDAG | [inline, protected] |
| getAncestorIterator(DoubleLinkedDAGNode node, GraphMatrix transitiveClosure) | utils.DoubleLinkedDAG | [inline] |
| getDescendantIterator(DoubleLinkedDAGNode node, GraphMatrix transitiveClosure) | utils.DoubleLinkedDAG | [inline] |
| getNode(int index) | utils.DoubleLinkedDAG | [inline] |
| getNodes() | utils.DoubleLinkedDAG | [inline] |
| getNumEdges() | utils.DoubleLinkedDAG | [inline] |
| getNumNodes() | utils.DoubleLinkedDAG | [inline] |
| hasEdge(DoubleLinkedDAGNode from, DoubleLinkedDAGNode to) | utils.DoubleLinkedDAG | [inline] |
| hasNode(int id) | utils.DoubleLinkedDAG | [inline] |
| hasNode(DoubleLinkedDAGNode node) | utils.DoubleLinkedDAG | [inline] |
| isAncestor(DoubleLinkedDAGNode possAnc, DoubleLinkedDAGNode possDesc) | utils.DoubleLinkedDAG | [inline] |
| isAncestor(DoubleLinkedDAGNode possAnc, DoubleLinkedDAGNode possDesc, GraphMatrix transitiveClosure) | utils.DoubleLinkedDAG | [inline] |
| iterator() | utils.DoubleLinkedDAG | [inline] |
| MARK_BEING_VISITED | utils.DoubleLinkedDAG | [protected, static] |
| MARK_DONE_VISITED | utils.DoubleLinkedDAG | [protected, static] |
| MARK_NOT_VISITED | utils.DoubleLinkedDAG | [protected, static] |
| nodeMarks | utils.DoubleLinkedDAG | [protected] |
| nodes | utils.DoubleLinkedDAG | [protected] |
| nodesVisited | utils.DoubleLinkedDAG | [protected] |
| numEdges | utils.DoubleLinkedDAG | [protected] |
| removeEdge(DoubleLinkedDAGNode from, DoubleLinkedDAGNode to) | utils.DoubleLinkedDAG | [inline] |
| toString() | utils.DoubleLinkedDAG | [inline] |
| toString(GraphMatrix graphMatrix) | utils.DoubleLinkedDAG | [inline] |
| toStringShort() | utils.DoubleLinkedDAG | [inline] |
| transClosureRecursion(GraphMatrix closure, DoubleLinkedDAGNode n, DoubleLinkedDAGNode descendant, boolean computeMinMaxDist, int distance) | utils.DoubleLinkedDAG | [inline, protected] |
| updateTransClosureForNewEdge(GraphMatrix transClosure, DoubleLinkedDAGNode fromNode, DoubleLinkedDAGNode toNode, boolean computeMinDistance) | utils.DoubleLinkedDAG | [inline] |
| visitChildrenPreOrder(DoubleLinkedDAGNode node, DoubleLinkedDAGVisitor visitor, boolean visitOnlyOnce) | utils.DoubleLinkedDAG | [inline] |
| visitChildrenPreOrder_Recursive(DoubleLinkedDAGNode node, DoubleLinkedDAGVisitor visitor, boolean visitOnlyOnce) | utils.DoubleLinkedDAG | [inline] |
| visitRoots(DoubleLinkedDAGVisitor visitor, boolean visitOnlyOnce) | utils.DoubleLinkedDAG | [inline] |