Date: Wed, 10 Jan 1996 17:49:14 -0600 From: Jon Loeliger <jdl@jdl.com> To: "Amancio Hasty Jr." <hasty@rah.star-gate.com> Cc: Terry Lambert <terry@lambert.org>, freebsd-hackers@FreeBSD.org Subject: Re: PnP problem... Message-ID: <199601102349.RAA00380@chrome.jdl.com> In-Reply-To: Your message of "Wed, 10 Jan 1996 13:16:36 PST." <199601102116.NAA02144@rah.star-gate.com>
next in thread | previous in thread | raw e-mail | index | archive | help
Apparently, "Amancio Hasty Jr." scribbled: > Terry most cool, now the next step. Care to write the > topological sort? 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...:-) jdl
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?199601102349.RAA00380>