Computing graph dominators
Summary
Technical explainer of computing graph dominators and dominator trees, covering the data-flow formulation, iterative idom calculation, and a Rust implementation. Includes discussion of reverse postorder traversal, practical performance notes, and links to related papers.