Newsgroups: comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news4.ner.bbnplanet.net!news.ner.bbnplanet.net!howland.reston.ans.net!swrinde!sgigate.sgi.com!sdd.hp.com!night.primate.wisc.edu!aplcenmp!hall
From: hall@aplcenmp.apl.jhu.edu (Marty Hall)
Subject: Re: topological sort
Message-ID: <DpJpuA.4t7@aplcenmp.apl.jhu.edu>
Organization: JHU/APL Research Center, Hopkins P/T CS Faculty
References: <4k61sh$c5d@boris.eden.com>
Date: Mon, 8 Apr 1996 13:37:22 GMT
Lines: 12

In article <4k61sh$c5d@boris.eden.com> ferret@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
