Proposal: Expose reverse topological ordering in Data.Graph

James Parker jp at
Thu Jun 6 15:43:57 UTC 2019

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 <david.feuer at> 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 <jp at <mailto:jp at>> wrote:
> Hi,
> I’d like to expose reverse topological ordering in Data.Graph. I’ve created a pull request <> that implements this. I named it `revTopSort` for now, but am fine with alternatives. 
> Thanks,
> James Parker
> _______________________________________________
> Libraries mailing list
> Libraries at <mailto:Libraries at>
> <>

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <>

More information about the Libraries mailing list