soot.toolkits.graph
Interface DirectedGraph

All Known Subinterfaces:
MutableDirectedGraph, TypeGraph
All Known Implementing Classes:
BlockGraph, UnitGraph

public interface DirectedGraph

Defines the notion of a directed graph.


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

Method Detail

getHeads

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

getTails

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

getPredsOf

public java.util.List getPredsOf(Directed s)
Returns a list of predecessors for the given node in the graph.
See Also:
Directed

getSuccsOf

public java.util.List getSuccsOf(Directed s)
Returns a list of successors for the given node in the graph.
See Also:
Directed

size

public int size()
Returns the node count for this graph.
See Also:
Directed

iterator

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