Dominator (graph theory)
id:
dominator-graph-theory-162-2692424
title:
Dominator (graph theory)
text:
In computer science, a node d of a control-flow graph 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. By definition, every node dominates itself. There are a number of related concepts:
- A node d strictly dominates a node n if d dominates n and d does not equal n.
- The immediate dominator or idom of a node n is the unique node that strictly dominates n but does not strictly dominate any other node that strictly dominate
brand slug:
wiki
category slug:
encyclopedia
description:
When every path in a control-flow graph must go through one node to reach another
original url:
https://en.wikipedia.org/wiki/Dominator_(graph_theory)
date created:
2003-12-10T15:00:05Z
date modified:
2024-08-27T15:00:32Z
main entity:
{"identifier":"Q2589498","url":"https://www.wikidata.org/entity/Q2589498"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/2/22/Dominator_control_flow_graph.svg","width":305,"height":349}
fields total:
13
integrity:
16