soot.toolkits.graph
Interface DirectedGraph<N>

All Superinterfaces:

Iterable<N>

All Known Subinterfaces:

ExceptionalGraph<N>, MutableDirectedGraph<N>, MutableEdgeLabelledDirectedGraph, ProgramDependenceGraph, ReversibleGraph

All Known Implementing Classes:

ArrayRefBlockGraph, AugmentedStmtGraph, BlockGraph, BriefBlockGraph, BriefUnitGraph, ClassicCompleteBlockGraph, ClassicCompleteUnitGraph, CompleteBlockGraph, CompleteUnitGraph, DirectedCallGraph, DominatorTreeAdapter, EnhancedBlockGraph, EnhancedUnitGraph, ExceptionalBlockGraph, ExceptionalUnitGraph, HashMutableDirectedGraph, HashMutableEdgeLabelledDirectedGraph, HashMutablePDG, HashReversibleGraph, InverseGraph, MemoryEfficientGraph, PegCallGraph, PegGraph, SimpleExceptionalGraph, TrapUnitGraph, UnitGraph, ZonedBlockGraph

public interface DirectedGraph<N>
extends Iterable<N>

Defines the notion of a directed graph.

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.

Method Detail

getHeads

List<N> getHeads()

Returns a list of entry points for this graph.

getTails

List<N> getTails()

Returns a list of exit points for this graph.

getPredsOf

List<N> getPredsOf(N s)

Returns a list of predecessors for the given node in the graph.

getSuccsOf

List<N> getSuccsOf(N s)

Returns a list of successors for the given node in the graph.

size

int size()

Returns the node count for this graph.

iterator

Iterator<N> iterator()

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

Specified by:

iterator in interface Iterable<N>