Dominators (Bytecoder Core 2020-05-12 API)

```
public class Dominators<T extends Node<? extends Node,? extends EdgeType>>
extends Object
```
Compute Dominators of a graph, following: A Simple, Fast Dominance Algorithm (Cooper, Keith D. and Harvey, Timothy J. and Kennedy, Ken).

Constructors
Constructor and Description
`Dominators(T rootNode, Comparator<T> comparator)`
`Dominators(T rootNode, Comparator<T> comparator, Predicate<Edge<EdgeType,T>> edgeFilter)`

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`boolean`	`dominates(T dominator, T dominated)` Check wheter a node dominates another one.
`Set<T>`	`domSetOf(T n)`
`T`	`getIDom(T node)`
`List<T>`	`getPreOrder()`
`Set<T>`	`getStrictDominators(T n)`

public Dominators(T rootNode,
                  Comparator<T> comparator)

public Dominators(T rootNode,
                  Comparator<T> comparator,
                  Predicate<Edge<EdgeType,T>> edgeFilter)

public Set<T> getStrictDominators(T n)

Class Dominators<T extends Node<? extends Node,? extends EdgeType>>