- From: Jonny Axelsson <jax@opera.com>
- Date: Thu, 17 Mar 2005 22:30:46 +0100
- To: "Bert Bos" <bert@w3.org>, Dominique Hazaël-Massieux <dom@w3.org>
- Cc: www-style@w3.org
On Thu, 17 Mar 2005 18:01:48 +0100, Bert Bos <bert@w3.org> wrote:
> There is a standard algorithm in computer science to sort a group of
> objects into one linear sequence, based on a set of pairwise relations
> between the objects. Say you have a set of objects {a, b, c, d, e} and
> relations such as
It might be useful to cluster the modules involved in those cycles. You
will then end up with a directed acyclic graph to which you can apply such
algorithms as the one above (treat a cluster of modules as if it was one
module).
Of course in the worst case there could be a cycle involving all modules
but that isn't the case here.
--
Jonny Axelsson,
Web Standards,
Opera Software ASA
Received on Thursday, 17 March 2005 21:31:24 UTC