computeDominators
Computes dominator relationships in the graph. A node X dominates node Y if every path from a root to Y must pass through X. Nodes that dominate many others are critical bottlenecks.
Uses the eager graph (construction-time dependencies only) since dominator analysis requires a DAG and is most meaningful for understanding construction order bottlenecks.