Re: "task" and beyond
On Wed, 5 Feb 2003 03:29:22 -0800,
Osamu Aoki <osamu@debian.org> wrote:
> (dependency check is
> N^2 problem and started to stress system badly.)
If someone implements an algorithm which splits a given set of packages
into 2 sets A and B so that no package in A depends on any package in B
and no package in B depends on any package in A, dependency check can be
a NlogN problem. However, usually what you want is "all packages that
are required to install this _one_ package", so I don't think dependency
check is a heavy problem.
--
Oohara Yuuma <oohara@libra.interq.or.jp>
Debian developer
PGP key (key ID F464A695) http://www.interq.or.jp/libra/oohara/pub-key.txt
Key fingerprint = 6142 8D07 9C5B 159B C170 1F4A 40D6 F42E F464 A695
Do not assume users will be motivated to read manuals
--- The GNU Privacy Handbook
Reply to: