id,summary,reporter,owner,description,type,status,priority,milestone,component,version,resolution,keywords,cc,os,architecture,failure,testcase,blockedby,blocking,related,differential
2227,(fgl) reimplement Data.Graph.Inductive.Query.Dominators,int-e,,"As pointed out at http://www.haskell.org/pipermail/haskell-cafe/2008-April/041739.html ff., {{{Data.Graph.Inductive.Query.Dominators.dom}}} is buggy. Furthermore, it's slow, so instead of submitting the quick fix from that thread, I've rewritten the module from scratch using a more efficient algorithm.
The algorithm works by calculating the immediate dominators of the graph nodes first, so the patch also adds a function that returns those. It should be handy for flow graph analysis.",proposal,closed,normal,,libraries (other),6.9,fixed,,,Unknown/Multiple,Unknown/Multiple,,,,,,