Finding the dominators in a control-flow graph.
Algorithm based on Loukas Georgiadis, “Linear-Time Algorithms for Dominators and Related Problems”, ftp://ftp.cs.princeton.edu/techreports/2005/737.pdf
Additionally useful is the original Lengauer-Tarjan paper on this subject, “A Fast Algorithm for Finding Dominators in a Flowgraph” Thomas Lengauer and Robert Endre Tarjan. https://www.cs.princeton.edu/courses/archive/spr03/cs423/download/dominators.pdf
- Tracks the list of dominators for each node.
- Time 🔒Describes the number of vertices discovered at the time when processing of a particular vertex started and when it finished. Both values are zero for unreachable vertices.