`graph-find-dominators-slowly!:`procedureThe fast dominator algorithm is difficult to prove correct, so this procedure is provided in order to check its results. The slow algorithm, which runs in time

`O(|E||V|)`, is adapted from Aho and Ullman,*The Theory of Parsing, Translation, and Compiling*, Prentice-Hall, 1973, p. 916.