[Haskell-cafe] Re: Breaking cycles in a directed graph.
red5_2 at hotmail.com
Sun Jul 16 13:25:22 EDT 2006
I ran across this problem a while ago, working on identifying edges in
dependence cycles for software pipelining. The problem you want to solve is
known as the "minimum feedback arc set" problem and is NP-hard. In my case,
I could use other knowledge about the problem domain to find a good
I'll refer you to the Wikipedia article:
I hope that helps.
More information about the Haskell-Cafe