Dominator (graph theory): Difference between revisions

Content deleted Content added
m -reference to basic block in tree defn, fix bug in code
mNo edit summary
Line 1:
''For non-computer uses of '''dominate''', see [[domination and submission]], [[dominator culture]], [[The Dominator]] (Dominik Hasek) or [[global domination]].''
 
In [[computer science]], in [[control flow graph]]s, a [[Node (computer science)|node]] '''d''' ''dominates'' a node '''n''' if every path from the start 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: