dominator.tree: Dominator tree

In igraph/rigraph: Network Analysis and Visualization

Dominator tree

Description

dominator.tree() was renamed to dominator_tree() to create a more consistent API.

Usage

dominator.tree(graph, root, mode = c("out", "in", "all", "total"))

Arguments

graph	A directed graph. If it is not a flowgraph, and it contains some vertices not reachable from the root vertex, then these vertices will be collected and returned as part of the result.
root	The id of the root (or source) vertex, this will be the root of the tree.
mode	Constant, must be ‘⁠in⁠’ or ‘out’. If it is ‘⁠in⁠’, then all directions are considered as opposite to the original one in the input graph.

igraph/rigraph documentation built on May 19, 2024, 6:19 a.m.