dominator_tree: Dominator Tree of a Graph
In nick-ulle/rstatic: Low-level Static Analysis Tools for R Code
Description
Usage
Arguments
Details
Value
Description
This function computes the dominator tree for a graph.
Usage
1
dominator_tree(g, root = 2)
Arguments
g
(igraph) The graph.
root
(integer) Index of the root node of the graph.
Details
This is a utility function to make working with igraph easier.
A block b_i dominates another block b_j when all paths to
b_j must pass through b_i. The closest dominator of a block
(excluding the block itself) is called its immediate dominator. In the
dominator tree, each block is a child of its immediate dominator.
Value
The dominator tree as an igraph graph.
nick-ulle/rstatic documentation built on Oct. 18, 2019, 4:38 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Details Value
Description
This function computes the dominator tree for a graph.
Usage
1 | dominator_tree(g, root = 2)
|
Arguments
g |
(igraph) The graph. |
root |
(integer) Index of the root node of the graph. |
Details
This is a utility function to make working with igraph easier.
A block b_i dominates another block b_j when all paths to b_j must pass through b_i. The closest dominator of a block (excluding the block itself) is called its immediate dominator. In the dominator tree, each block is a child of its immediate dominator.
Value
The dominator tree as an igraph graph.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
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.