From owner-freebsd-hackers  Wed Jan 10 15:51:19 1996
Return-Path: owner-hackers
Received: (from root@localhost)
          by freefall.freebsd.org (8.7.3/8.7.3) id PAA13473
          for hackers-outgoing; Wed, 10 Jan 1996 15:51:19 -0800 (PST)
Received: from chrome.jdl.com (chrome.onramp.net [199.1.166.202])
          by freefall.freebsd.org (8.7.3/8.7.3) with SMTP id PAA13468
          for <freebsd-hackers@FreeBSD.org>; Wed, 10 Jan 1996 15:51:11 -0800 (PST)
Received: from localhost (localhost [127.0.0.1]) by chrome.jdl.com (8.6.12/8.6.12) with SMTP id RAA00380; Wed, 10 Jan 1996 17:49:25 -0600
Message-Id: <199601102349.RAA00380@chrome.jdl.com>
X-Authentication-Warning: chrome.jdl.com: Host localhost didn't use HELO protocol
To: "Amancio Hasty Jr." <hasty@rah.star-gate.com>
cc: Terry Lambert <terry@lambert.org>, freebsd-hackers@FreeBSD.org
Subject: Re: PnP problem... 
In-reply-to: Your message of "Wed, 10 Jan 1996 13:16:36 PST."
             <199601102116.NAA02144@rah.star-gate.com> 
Clarity-Index: null
Threat-Level: none
Software-Engineering-Dead-Seriousness: There's no excuse for unreadable code.
Net-thought: If you meet the Buddha on the net, put him in your Kill file.
Date: Wed, 10 Jan 1996 17:49:14 -0600
From: Jon Loeliger <jdl@jdl.com>
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.
(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