soot.toolkits.graph
Interface DirectedGraph

All Known Subinterfaces:
ExceptionalGraph, MutableDirectedGraph, ReversibleGraph
All Known Implementing Classes:
AugmentedStmtGraph, BlockGraph, DirectedCallGraph, DominatorTreeAdapter, ExceptionalBlockGraph, ExceptionalUnitGraph, HashMutableDirectedGraph, HashReversibleGraph, UnitGraph

public interface DirectedGraph

Defines the notion of a directed graph.


Method Summary
 List getHeads()
          Returns a list of entry points for this graph.
 List getPredsOf(Object s)
          Returns a list of predecessors for the given node in the graph.
 List getSuccsOf(Object s)
          Returns a list of successors for the given node in the graph.
 List getTails()
          Returns a list of exit points for this graph.
 Iterator iterator()
          Returns an iterator for the nodes in this graph.
 int size()
          Returns the node count for this graph.
 

Method Detail

getHeads

public List getHeads()
Returns a list of entry points for this graph.


getTails

public List getTails()
Returns a list of exit points for this graph.


getPredsOf

public List getPredsOf(Object s)
Returns a list of predecessors for the given node in the graph.


getSuccsOf

public List getSuccsOf(Object s)
Returns a list of successors for the given node in the graph.


size

public int size()
Returns the node count for this graph.


iterator

public Iterator iterator()
Returns an iterator for the nodes in this graph. No specific ordering of the nodes is guaranteed.