This is the mail archive of the
mailing list for the Cygwin project.
Re: New Setup for Cygwin 1.7 on cygwin.com
Corinna Vinschen wrote:
I looked a while into the algorithm doing the dependency ordering. What
it does is to create an ordered list sorted by using the algorithm to
find the strongly connected components in a directed graph. The problem
is that this algorithm works fine and creates a nice dependeny ordered
list unless there are loops in the dependencies. In this case you just
get a list of strongly connected components in arbitrary order.
Anybody having another funny idea?
What about detecting a dependency loop by checking to see if the next
package in the dependency list is already in the list. If there's a loop
Or is it possible for there to be new nodes after the first duplicate