From: schermerhorm
Subject: topological sort
Date: Sat, 06 Apr 1996 00:00:00 +0000
Message-ID: <4k61sh$c5d@boris.eden.com>

Does anyone know how to do a topological sort of a directed 
graph in lisp?

From: Marty Hall
Subject: Re: topological sort
Date: Mon, 08 Apr 1996 00:00:00 +0000
Message-ID: <DpJpuA.4t7@aplcenmp.apl.jhu.edu>

In article <··········@boris.eden.com> ······@eden.com (schermerhorm) writes:
>Does anyone know how to do a topological sort of a directed 
>graph in lisp?

Cormen, Leisersen and Rivest (Introduction to Algorithms) give an
algorithm in Chapter 23. Probably other Algorithms texts do also. Note
that the graph has to be cycle free.

Cheers-
						- Marty
(proclaim '(inline skates))
http://www.apl.jhu.edu/~hall/lisp.html