public class InverseGraph<N> extends Object implements DirectedGraph<N>
Modifier and Type | Field and Description |
---|---|
protected DirectedGraph<N> |
g |
Constructor and Description |
---|
InverseGraph(DirectedGraph<N> g) |
Modifier and Type | Method and Description |
---|---|
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.
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
forEach, spliterator
protected final DirectedGraph<N> g
public InverseGraph(DirectedGraph<N> g)
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()
public int size()
size
in interface DirectedGraph<N>