[comp.theory] finding all cycles in a directed gr

gillies@p.cs.uiuc.edu (03/17/90)

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