DominatorTree<'V, 'E> (B2R2)

DominatorTree<'V, 'E> Type

Dominator tree interface. A dominator tree is a tree where each node's children are those nodes it immediately dominates.

Constructor Description

Constructor	Description
`DominatorTree(g, getIDom)` Full Usage: `DominatorTree(g, getIDom)` Parameters: g : `IDiGraphAccessible<'V, 'E>` getIDom : `IVertex<'V> -> IVertex<'V>` Returns: `DominatorTree<'V, 'E>`	g : `IDiGraphAccessible<'V, 'E>` getIDom : `IVertex<'V> -> IVertex<'V>` Returns: `DominatorTree<'V, 'E>`


                
                  
                    
                      DominatorTree(g, getIDom)

Full Usage: DominatorTree(g, getIDom)

Parameters:

g : IDiGraphAccessible<'V, 'E>

getIDom : IVertex<'V> -> IVertex<'V>

Returns: DominatorTree<'V, 'E>

Instance member	Description
`this.GetChildren` Full Usage: `this.GetChildren` Parameters: v : `IVertex<'V>` Returns: `List<IVertex<'V>>`	Get the children of a vertex in the dominator tree. v : `IVertex<'V>` Returns: `List<IVertex<'V>>`
`this.GetRoot` Full Usage: `this.GetRoot` Returns: `IVertex<'V>`	Get the dummy root. Dummy root points to all the roots of the dominator tree. Returns: `IVertex<'V>`