Le lun 17/03/2003 � 19:55, Wesley J. Landaker a �crit : > urpmi then installs them all, supposedly in a nice correct order (I don't > doubt it's correct--I just haven't ever looked at how it does it currently
No problem, this problem is solved by rpmlib which looks at PreReqs and Requires. > Instead, what urpmi could do is the following (and maybe it already does > some of this internally--if so, hey! less work!) Currently, urpmi use a non recursive algorithms without global optimization on requires to be fetched (to be fast enough, do not forget resolution algorithms is pure perl wchich is fast but interpreted). > Yeah, it's not going to get the perfectly smallest subsets when there are > cycles. But it in real practical use for RPMs it's *going* to generally > find lots of small subsets, even if they're not optimal, with very little > processing overhead. > This is what will be done, I didn't looked yet about a specific algorithm but I is effectively not very hard to solve. Fran�ois.
