This function computes the dominator tree for a graph.
dominator_tree(g, root = 2)
(igraph) The graph.
(integer) Index of the root node of the graph.
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.
The dominator tree as an igraph graph.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.