DirectedGraph (Soot - a J*va Optimization Framework 4.6.0 API)

Type Parameters:

N - node type

All Superinterfaces:

Iterable<N>

All Known Subinterfaces:

DirectedBodyGraph<N>, 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, ExtendedHashMutableDirectedGraph, 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

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	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.

Methods inherited from interface java.lang.Iterable
forEach, spliterator

- 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>