Date: Wed, 10 Jan 1996 19:30:34 -0700 (MST) From: Ade Barkah <mbarkah@hemi.com> 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: <199601110230.TAA20537@hemi.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
> 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. Two words: "man tsort" -Ade Barkah -------------------------------------------------------------------- Inet: mbarkah@hemi.com - HEMISPHERE ONLINE - www: <http://hemi.com/>; --------------------------------------------------------------------
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?199601110230.TAA20537>