Description Usage Arguments Details Value References

This function computes the dominance frontiers for a graph.

1 | ```
dominance_frontiers(g, dom_t = dominator_tree(g))
``` |

`g` |
(igraph) The graph. |

`dom_t` |
(igraph) The dominator tree for the graph. |

The dominance frontier for a block *b* is the set of all blocks *y*
such that *b* dominates a predecessor of *y* but does not strictly
dominate *y*. In other words, the dominance frontier for *b* is the
set of blocks immediately beyond the blocks dominated by *b*, where
control-flow merges from a separate part of the program.

A graph with a vertex for each vertex in the original graph. Each vertex has edges to all vertices in its dominance frontier.

Cooper, K. D., Harvey T. J., and Kennedy, K. (2001) A simple, fast dominance algorithm. Software Practice & Experience 4, 1-10.

Cooper, K. D. and Torczon, L. (2012) Engineering a Compiler. Elsevier.

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.