Data.Graph transitive closure

[David Feuer]

I just noticed that Data.Graph doesn't offer a transitive closure
operation. Looking into implementing one, I discovered that doing so
efficiently has been the subject of non-trivial research [*]. So if there's
any demand, we should try to implement a reasonably efficient version in
containers. Anybody want one?

[*] http://www.cs.hut.fi/~enu/thesis.html
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/libraries/attachments/20190619/4e5e6b34/attachment.html>