soot.toolkits.graph

Interface DirectedGraph<N>

All Superinterfaces:

java.lang.Iterable<N>

All Known Subinterfaces:

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

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 java.lang.Iterable<N>

Defines the notion of a directed graph.

Method Summary

Modifier and Type	Method and Description
java.util.List<N>	getHeads() Returns a list of entry points for this graph.
java.util.List<N>	getPredsOf(N s) Returns a list of predecessors for the given node in the graph.
java.util.List<N>	getSuccsOf(N s) Returns a list of successors for the given node in the graph.
java.util.List<N>	getTails() Returns a list of exit points for this graph.
java.util.Iterator<N>	iterator() Returns an iterator for the nodes in this graph.
int	size() Returns the node count for this graph.

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Method Detail

getHeads

java.util.List<N> getHeads()

Returns a list of entry points for this graph.

getTails

java.util.List<N> getTails()

Returns a list of exit points for this graph.

getPredsOf

java.util.List<N> getPredsOf(N s)

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

getSuccsOf

java.util.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

java.util.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 java.lang.Iterable<N>