|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectsoot.toolkits.graph.PseudoTopologicalOrderer<N>
public class PseudoTopologicalOrderer<N>
Orders in pseudo-topological order, the nodes of a DirectedGraph instance.
| Field Summary | |
|---|---|
static boolean |
REVERSE
|
| Constructor Summary | |
|---|---|
PseudoTopologicalOrderer()
|
|
PseudoTopologicalOrderer(boolean isReversed)
Deprecated. use PseudoTopologicalOrderer() instead |
|
| Method Summary | |
|---|---|
protected List<N> |
computeOrder(DirectedGraph<N> g)
Orders in pseudo-topological order. |
boolean |
isReverseOrder()
Deprecated. use #newList(DirectedGraph, boolean)) instead |
List<N> |
newList(DirectedGraph g)
Deprecated. use #newList(DirectedGraph, boolean)) instead |
List<N> |
newList(DirectedGraph<N> g,
boolean reverse)
Builds an order for a directed graph. |
void |
setReverseOrder(boolean isReversed)
Deprecated. use #newList(DirectedGraph, boolean)) instead |
protected void |
visitNode(N startStmt)
|
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
public static final boolean REVERSE
| Constructor Detail |
|---|
public PseudoTopologicalOrderer()
public PseudoTopologicalOrderer(boolean isReversed)
PseudoTopologicalOrderer() instead
| Method Detail |
|---|
public List<N> newList(DirectedGraph<N> g,
boolean reverse)
newList in interface Orderer<N>g - a DirectedGraph instance whose nodes we wish to orderreverse - true to compute the reverse order
protected List<N> computeOrder(DirectedGraph<N> g)
g - a DirectedGraph instance we want to order the nodes for.
protected void visitNode(N startStmt)
public List<N> newList(DirectedGraph g)
#newList(DirectedGraph, boolean)) instead
g - a DirectedGraph instance whose nodes we wish to order.
public void setReverseOrder(boolean isReversed)
#newList(DirectedGraph, boolean)) instead
isReverse - specify if we want reverse pseudo-topological ordering, or
not.public boolean isReverseOrder()
#newList(DirectedGraph, boolean)) instead
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||