dominator_tree: Dominator Tree of a Graph

Description Usage Arguments Details Value

View source: R/igraph.R

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/ast documentation built on July 17, 2018, 4:16 a.m.