Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!cs.utexas.edu!usc!brutus.cs.uiuc.edu!ux1.cso.uiuc.edu!ux1.cso.uiuc.edu!m.cs.uiuc.edu!p.cs.uiuc.edu!gillies
From: gillies@p.cs.uiuc.edu
Newsgroups: comp.theory
Subject: Re: finding all cycles in a directed gr
Message-ID: <100600019@p.cs.uiuc.edu>
Date: 17 Mar 90 01:39:44 GMT
References: <1153@laas.laas.fr>
Lines: 18
Nf-ID: #R:laas.laas.fr:1153:p.cs.uiuc.edu:100600019:000:604
Nf-From: p.cs.uiuc.edu!gillies    Mar 15 20:29:00 1990


here's a textbook with an algorithm for generating all the cycles of a
digraph.

	Reingold, Nievergelt, Deo, "Combinatorial Algorithms"
	Prentice-Hall, 1977	
	pp348-353.

One nice thing about this book is that its references are fully
annotated.  In this case, the reference points to:

Read, R. C., and R. E. Tarjan, "Bounds on Backtrack Algorithms for
Listing Cycles, Paths, and Spanning Trees,"  Networks 5(1975), 237-252.


Don W. Gillies, Dept. of Computer Science, University of Illinois
1304 W. Springfield, Urbana, Ill 61801      
ARPA: gillies@cs.uiuc.edu   UUCP: {uunet,harvard}!uiucdcs!gillies