DominatorVertexList
DominatorVertexList
DominatorVertexList[g,r]
gives the list of dominators of the directed graph g from the root vertex r.
Details
- DominatorVertexList is also known as immediate dominators.
- Typically used to analyze and detect dependencies in flow graphs.
- For a graph g with vertices {u1,u2,…}, DominatorVertexList[g,r] gives a list of vertices {v1,v2,…} where every path from r to ui goes through vi.
- DominatorVertexList[g,r] returns a list of predecessor vertices vi of vertices ui where vi dominates ui.
Examples
open all close allScope (1)
DominatorVertexList works with directed graphs:
Properties & Relations (1)
Use DominatorTreeGraph to find the dominator tree of the given graph:
Wolfram Research (2021), DominatorVertexList, Wolfram Language function, https://reference.wolfram.com/language/ref/DominatorVertexList.html.
Text
Wolfram Research (2021), DominatorVertexList, Wolfram Language function, https://reference.wolfram.com/language/ref/DominatorVertexList.html.
CMS
Wolfram Language. 2021. "DominatorVertexList." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/DominatorVertexList.html.
APA
Wolfram Language. (2021). DominatorVertexList. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/DominatorVertexList.html