It's hard to imagine reaching for a graph without some thought that you'd
want to compute a closure. I've wanted this in the past, but I've never
thought seriously about using Data.Graph for it. Perhaps this is why?
On Wed, Jun 19, 2019 at 6:20 PM 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 _______________________________________________ Libraries mailing list Libraries@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries