Re: Proposal: Expose reverse topological ordering in Data.Graph

My application is I have a dependency graph (DAG) where `a` depends on `b` (a -> b). I need to process all dependencies of a node before processing that node. Currently I’m doing `reverse . topSort` which is `reverse . reverse . postOrd`.

On Jun 5, 2019, at 8:50 PM, David Feuer wrote:

If there's an application, I firmly believe we should add it. The name is up for grabs.

On Wed, Jun 5, 2019, 8:49 PM James Parker mailto:jp@jamesparker.me> wrote: Hi,

I’d like to expose reverse topological ordering in Data.Graph. I’ve created a pull request https://github.com/haskell/containers/pull/638 that implements this. I named it `revTopSort` for now, but am fine with alternatives.

Thanks,

James Parker

_______________________________________________ Libraries mailing list Libraries@haskell.org mailto:Libraries@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries