|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectsoot.toolkits.graph.InverseGraph<N>
public class InverseGraph<N>
An inverted graph of a directed graph.
| Field Summary | |
|---|---|
protected DirectedGraph<N> |
g
|
| Constructor Summary | |
|---|---|
InverseGraph(DirectedGraph<N> g)
|
|
| Method Summary | |
|---|---|
List<N> |
getHeads()
Returns a list of entry points for this graph. |
List<N> |
getPredsOf(N s)
Returns a list of predecessors for the given node in the graph. |
List<N> |
getSuccsOf(N s)
Returns a list of successors for the given node in the graph. |
List<N> |
getTails()
Returns a list of exit points for this graph. |
Iterator<N> |
iterator()
Returns an iterator for the nodes in this graph. |
int |
size()
Returns the node count for this graph. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
protected final DirectedGraph<N> g
| Constructor Detail |
|---|
public InverseGraph(DirectedGraph<N> g)
| Method Detail |
|---|
public List<N> getHeads()
getHeads in interface DirectedGraph<N>public List<N> getPredsOf(N s)
getPredsOf in interface DirectedGraph<N>public List<N> getSuccsOf(N s)
getSuccsOf in interface DirectedGraph<N>public List<N> getTails()
getTails in interface DirectedGraph<N>public Iterator<N> iterator()
iterator in interface Iterable<N>iterator in interface DirectedGraph<N>public int size()
size in interface DirectedGraph<N>
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||