On 12/8/05, Aaron Hanson <a.hanson@xxxxxx> wrote: > Um, nevermind, sort of. I've discovered that if I use rpmtsCheck() first > (optional for rpmgraph), the final order is the same as rpm chooses at > the cmd line. If anybody can give a conceptual explanation of why this > is, I'd find it helpful. Thanks again. > -Aaron Well the first thing to think about is that the topological sort of the packages based on dependencies is by definition a partial ordering. The key is that any node in the graph is guaranteed to follow who it depends on. That said because everything does not ultimately depend on some one package, you end up with multiple trees. The order of these trees is not deterministic. Furthermore, say package C D and E depend on package A, then C, D and E can be installed in any order as long as A is installed first. What this really means is dependencies need to be correct and their must be no dependency loops, for sans these two items a correct partial ordering is not possible. Cheers...james _______________________________________________ Rpm-list mailing list Rpm-list@xxxxxxxxxx https://www.redhat.com/mailman/listinfo/rpm-list
