New Setup for Cygwin 1.7 on cygwin.com

[Ralph Hempel]

Corinna Vinschen wrote:
> On Aug 27 15:07, Ralph Hempel wrote:

> Dependency loops are already detected, just the result is less than
> desirable.  It's a stadard problem of loops in directed graphs.  There's
> no way to create a topological sort order and the result of any sort
> algorithm is basically not determinate.  So you have to put some
> additional heuristic into the algorithm to get a sort order you desire.

Ah. Perhaps I should dig into Volume 3 of my Knuth books.....

For what it's worth, I think that your approach of tackling the
algorithm and making it run correctly is going to get a better
end result than hacking at the description file.

Cheers, Ralph