[Date Prev][Date Next] [Thread Prev][Thread Next] [Date Index] [Thread Index]

Re: Getting rid of circular dependencies, stage 3

On Friday 13 January 2006 16:53, you wrote:
> Adrian von Bidder <avbidder@fortytwo.ch> writes:
> > From a graph algorithm point of view, if I'm not very mistaken,
> > dependencies being guaranteed to be a directed graph instead of a
> > generic graph should allow some simplifications/efficiency
> > improvements in apt and other tools, too.
> For the record, dependencies are a directed graph by nature.
> Preventing circular dependencies will get you a directed acyclic graph
> (DAG) which is, IMHO, easier to handle.

Arrgh.  Of course, just a confusion of terms.

-- vbi

F: Was ist ein Pensch?
A: Das mittlere Stück von einem Lam-pensch-irm

Attachment: pgpj91wEGN01A.pgp
Description: PGP signature

Reply to: