DominatorVertexList

DominatorVertexList[g,v]

gives the list of immediate dominators of the directed graph g from the root vertex v.

Details

  • Typically used to analyze and detect dependencies in flow graphs.
  • DominatorVertexList[g,v] gives a list of predecessor vertices wi of vertices ui where ui immediately dominates wi. Every path from v to wi goes through ui.

Examples

open allclose all

Basic Examples  (1)

Give the list of immediate dominators of the directed graph:

Scope  (1)

DominatorVertexList works with directed graphs:

Properties & Relations  (1)

Use DominatorTreeGraph to find the dominator tree of the given graph:

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

Text

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

CMS

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

APA

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

BibTeX

@misc{reference.wolfram_2021_dominatorvertexlist, author="Wolfram Research", title="{DominatorVertexList}", year="13", howpublished="\url{https://reference.wolfram.com/language/ref/DominatorVertexList.html}", note=[Accessed: 24-January-2022 ]}

BibLaTeX

@online{reference.wolfram_2021_dominatorvertexlist, organization={Wolfram Research}, title={DominatorVertexList}, year={13}, url={https://reference.wolfram.com/language/ref/DominatorVertexList.html}, note=[Accessed: 24-January-2022 ]}