Date: Wed, 10 Jan 1996 19:41:32 -0700 (MST) From: Terry Lambert <terry@lambert.org> To: jdl@jdl.com (Jon Loeliger) Cc: hasty@rah.star-gate.com, terry@lambert.org, freebsd-hackers@FreeBSD.org Subject: Re: PnP problem... Message-ID: <199601110241.TAA16268@phaeton.artisoft.com> In-Reply-To: <199601102349.RAA00380@chrome.jdl.com> from "Jon Loeliger" at Jan 10, 96 05:49:14 pm
next in thread | previous in thread | raw e-mail | index | archive | help
> 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.
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?199601110241.TAA16268>