DominatorTreeGraph

DominatorTreeGraph[g,r]

gives the dominator tree of the directed graph g from the root vertex r.

Details and Options

  • DominatorTreeGraph is also known as immediate dominator tree.
  • Typically used to analyze and detect dependencies in flow graphs.
  • DominatorTreeGraph[g,r] gives a tree with a directed edge from a vertex u to a vertex v it immediately dominates. Every path from r to v goes through u.
  • DominatorTreeGraph takes the same options as TreeGraph.

Examples

open allclose all

Basic Examples  (1)

Give the dominator tree of the directed graph:

Scope  (1)

DominatorTreeGraph works with directed graphs:

Properties & Relations  (1)

Use DominatorVertexList to find the list of immediate dominators:

Wolfram Research (2021), DominatorTreeGraph, Wolfram Language function, https://reference.wolfram.com/language/ref/DominatorTreeGraph.html.

Text

Wolfram Research (2021), DominatorTreeGraph, Wolfram Language function, https://reference.wolfram.com/language/ref/DominatorTreeGraph.html.

CMS

Wolfram Language. 2021. "DominatorTreeGraph." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/DominatorTreeGraph.html.

APA

Wolfram Language. (2021). DominatorTreeGraph. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/DominatorTreeGraph.html

BibTeX

@misc{reference.wolfram_2025_dominatortreegraph, author="Wolfram Research", title="{DominatorTreeGraph}", year="2021", howpublished="\url{https://reference.wolfram.com/language/ref/DominatorTreeGraph.html}", note=[Accessed: 21-February-2025 ]}

BibLaTeX

@online{reference.wolfram_2025_dominatortreegraph, organization={Wolfram Research}, title={DominatorTreeGraph}, year={2021}, url={https://reference.wolfram.com/language/ref/DominatorTreeGraph.html}, note=[Accessed: 21-February-2025 ]}