This is the mail archive of the cygwin-apps mailing list for the Cygwin project.
Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
---|---|---|
Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |
Other format: | [Raw text] |
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?
Or is it possible for there to be new nodes after the first duplicate dependency?
Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
---|---|---|
Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |