From owner-freebsd-hackers Wed Jan 10 18:31:04 1996 Return-Path: owner-hackers Received: (from root@localhost) by freefall.freebsd.org (8.7.3/8.7.3) id SAA22206 for hackers-outgoing; Wed, 10 Jan 1996 18:31:04 -0800 (PST) Received: from hemi.com (hemi.com [204.132.158.10]) by freefall.freebsd.org (8.7.3/8.7.3) with SMTP id SAA22201 for ; Wed, 10 Jan 1996 18:30:58 -0800 (PST) Received: (from mbarkah@localhost) by hemi.com (8.6.11/8.6.9) id TAA20537; Wed, 10 Jan 1996 19:30:34 -0700 From: Ade Barkah Message-Id: <199601110230.TAA20537@hemi.com> Subject: Re: PnP problem... To: jdl@jdl.com (Jon Loeliger) Date: Wed, 10 Jan 1996 19:30:34 -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] Content-Type: text Sender: owner-hackers@freebsd.org Precedence: bulk > 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: --------------------------------------------------------------------