Groups
Category
A dominator tree summarizes “must-pass” relationships in a directed graph from a chosen root r: u dominates v if every path from r to v goes through u.
An invariant is a property you promise to keep true throughout an algorithm, and it is the anchor of both design and correctness proofs.