From owner-freebsd-hackers Wed Jan 10 18:46:20 1996 Return-Path: owner-hackers Received: (from root@localhost) by freefall.freebsd.org (8.7.3/8.7.3) id SAA23255 for hackers-outgoing; Wed, 10 Jan 1996 18:46:20 -0800 (PST) Received: from phaeton.artisoft.com (phaeton.Artisoft.COM [198.17.250.211]) by freefall.freebsd.org (8.7.3/8.7.3) with SMTP id SAA23250 for ; Wed, 10 Jan 1996 18:46:15 -0800 (PST) Received: (from terry@localhost) by phaeton.artisoft.com (8.6.11/8.6.9) id TAA16268; Wed, 10 Jan 1996 19:41:32 -0700 From: Terry Lambert Message-Id: <199601110241.TAA16268@phaeton.artisoft.com> Subject: Re: PnP problem... To: jdl@jdl.com (Jon Loeliger) Date: Wed, 10 Jan 1996 19:41:32 -0700 (MST) Cc: hasty@rah.star-gate.com, terry@lambert.org, freebsd-hackers@FreeBSD.org In-Reply-To: <199601102349.RAA00380@chrome.jdl.com> from "Jon Loeliger" at Jan 10, 96 05:49:14 pm X-Mailer: ELM [version 2.4 PL24] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Sender: owner-hackers@FreeBSD.org Precedence: bulk > In general, topological sorts are "easy". > If couched in terms of a general graph with dependency arcs, > the classic approach would be to use Tarjan's algorithm. > > One should be able to either find this online in any number > of places, or extract it from most any algorithms book. > (Make uses it, any reasonable code generator, etc.) > I might even be tricked into writing one, although I'm sure > I only vaguely understand the direct application here...:-) Presumably, it's there because of the assumption (I made) that some settings will imply value restrictions on others. Mostly this is a problem for I/O and mapped memory spaces, I believe. I thought everyone owned Knuth... Terry Lambert terry@lambert.org --- Any opinions in this posting are my own and not those of my present or previous employers.