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

All Known Implementing Classes:

MHGDominatorsFinder, MHGPostDominatorsFinder, SimpleDominatorsFinder
```
public interface DominatorsFinder<N>
```
General interface for a dominators analysis.

Author:

Navindra Umanee

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`List<N>`	`getDominators(N node)`	Returns a list of dominators for the given node in the graph.
`DirectedGraph<N>`	`getGraph()`	Returns the graph to which the analysis pertains.
`N`	`getImmediateDominator(N node)`	Returns the immediate dominator of node or null if the node has no immediate dominator.
`boolean`	`isDominatedBy(N node, N dominator)`	True if "node" is dominated by "dominator" in the graph.
`boolean`	`isDominatedByAll(N node, Collection<N> dominators)`	True if "node" is dominated by all nodes in "dominators" in the graph.

- Method Detail
  - getGraph
```
DirectedGraph<N> getGraph()
```
    Returns the graph to which the analysis pertains.
  - getDominators
```
List<N> getDominators(N node)
```
    Returns a list of dominators for the given node in the graph.
  - getImmediateDominator
```
N getImmediateDominator(N node)
```
    Returns the immediate dominator of node or null if the node has no immediate dominator.
  - isDominatedBy
```
boolean isDominatedBy(N node,
                      N dominator)
```
    True if "node" is dominated by "dominator" in the graph.
  - isDominatedByAll
```
boolean isDominatedByAll(N node,
                         Collection<N> dominators)
```
    True if "node" is dominated by all nodes in "dominators" in the graph.