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
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
Die Dominanzrelation ist eine ...... raphen $ G\langle V,E,1angle $
@de
In computer science, in contro ...... node is the root of the tree.
@en
Доминатор в теории графов — би ...... над своими потомками в дереве.
@ru
在计算机科学中，控制流图的一个节点 d 支配节点 n，当且仅 ...... 点。由于最近必经点是唯一的，故其为一棵树，开始节点即为树根。
@zh
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
739,580,917
type
comment
Die Dominanzrelation ist eine ...... Dominanzrelation reflexiv. aus
@de
In computer science, in contro ...... a number of related concepts:
@en
Доминатор в теории графов — би ...... над своими потомками в дереве.
@ru
在计算机科学中，控制流图的一个节点 d 支配节点 n，当且仅 ...... 点。由于最近必经点是唯一的，故其为一棵树，开始节点即为树根。
@zh
label
Dominanzrelation (Kontrollflussgraph)
@de
Dominator (graph theory)
@en
Доминатор (теория графов)
@ru
支配
@zh
