úÎ!Ø:     (c) Matt Morrow 2009BSD3<klebinger.andreas@gmx.at>stableportableNone>SXlm¨ dom-lt Dominators. Complexity as for idomdom-ltPost-dominators. Complexity as for idom.dom-ltDominator tree. Complexity as for idom.dom-ltPost-dominator tree. Complexity as for idom. dom-ltImmediate dominators. O(|E|*alpha(|E|,|V|)), where  alpha(m,n)4 is "a functional inverse of Ackermann's function".This Complexity bound assumes O(1) indexing. Since we're using IntMap, it has an additional lg |V|0 factor somewhere in there. I'm not sure where. dom-ltImmediate post-dominators. Complexity as for idom. dom-lt!Post-dominated depth-first search. dom-lt)Reverse post-dominated depth-first search.dom-lt arr .= x idx => write x to indexdom-ltrenum n g: Rename all nodeshGives nodes sequential names starting at n. Returns the new graph and a mapping. (renamed, old -> new)   29 NoneSX&dom-ltFor debugging only      #dom-lt-0.2.2-9q7EgqUmQTd2NlMwgGouo0Data.Graph.DomData.Graph.Dom.InternalRootedGraphEdgePathNodedompdomdomTreepdomTreeidomipdompddfsrpddfsfromAdj fromEdgestoAdjtoEdgesparents ancestorsasGraphasTree$fApplicativeS$fMonadS $fFunctorSnewline asDotFile.=renum!: