LengauerTarjanDominance (B2R2)

LengauerTarjanDominance Module

Lengauer-Tarjan dominance algorithm for dominator computation. A fast algorithm for finding dominators in a flow graph, TOPLAS 1979.

Function or value Description

Function or value	Description
`create g dfp` Full Usage: `create g dfp` Parameters: g : `IDiGraphAccessible<'a, 'b>` dfp : `IDominanceFrontierProvider<'a, 'b>` Returns: `IDominance<'a, 'b>`	g : `IDiGraphAccessible<'a, 'b>` dfp : `IDominanceFrontierProvider<'a, 'b>` Returns: `IDominance<'a, 'b>`


                
                  
                    
                      create g dfp

Full Usage: create g dfp

Parameters:

g : IDiGraphAccessible<'a, 'b>

dfp : IDominanceFrontierProvider<'a, 'b>

Returns: IDominance<'a, 'b>