Dominator (graph theory)
In computer science, in control-flow graphs, a node d dominates a node n if every path from the entry node to n must go through d. Notationally, this is written as d dom n (or sometimes d n). By definition, every node dominates itself. There are a number of related concepts:
Wikipage disambiguates
Basic blockControl-flow graphData dependencyDominatorDominator (node)Frama-CGraph-toolLengauer-Tarjan's algorithmLengauer-Tarjan algorithmLengauer–Tarjan's algorithmLengauer–Tarjan algorithmPost-dominancePost-dominatorPostdominancePostdominatePostdominatorResource management (computing)Soot (software)Static single assignment formThomas Lengauer
Link from a Wikipage to another Wikipage
primaryTopic
Dominator (graph theory)
In computer science, in control-flow graphs, a node d dominates a node n if every path from the entry node to n must go through d. Notationally, this is written as d dom n (or sometimes d n). By definition, every node dominates itself. There are a number of related concepts:
has abstract
In computer science, in contro ...... node is the root of the tree.
@en
Доминатор в теории графов — би ...... над своими потомками в дереве.
@ru
在计算机科学中,控制流图的一个节点 d 支配节点 n,当且仅 ...... 节点即为树根。
* 求解支配树一般使用 Tarjan 算法
@zh
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,016,692,778
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
type
comment
In computer science, in contro ...... a number of related concepts:
@en
Доминатор в теории графов — би ...... еории построения компиляторов.
@ru
在计算机科学中,控制流图的一个节点 d 支配节点 n,当且仅 ...... 节点即为树根。
* 求解支配树一般使用 Tarjan 算法
@zh
label
Dominanzrelation (Kontrollflussgraph)
@de
Dominator (graph theory)
@en
Доминатор (теория графов)
@ru
支配 (圖論)
@zh