Re: package dependency as applied math (was: Re: tape deity)
Manoj writes:
> Of course. It is a simple topological sort. How do you think that the
> ordering code works? pkg-order, and now deity, anre not haphazard trial
> and error methods.
Of course not. That's the easy part.
> The issue is more complex than simple graph theory algorithms;...
But perhaps not more complex than sophisticated ones.
> ... since diffrent actions requirte different set of edges in the
> graph; also, not all nodes are equivalent, and not all edges
> have the same cost.
> Consider the invariants that must never be broken to retail a
> working system, and you have a gliimering of the complexity that is
> involved.
This is exactly what I mean by the general dependency problem. A
rigorous analysis might be valuable without producing a complete
closed form solution.
A related approach is to build models.
> we are not all code first, think later genre of hackers, you know
Did I say you were?
--
John Hasler
john@dhh.gt.org (John Hasler)
Dancing Horse Hill
Elmwood, WI
--
To UNSUBSCRIBE, email to debian-devel-request@lists.debian.org
with a subject of "unsubscribe". Trouble? Contact listmaster@lists.debian.org
Reply to: