Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!samsung!usc!snorkelwacker!apple!agate!darkstar!swbatl.sbc.com
From: cunetto@swbatl.sbc.com (Phillip Cunetto)
Newsgroups: comp.os.research
Subject: Finding cycles in directed graphs.
Message-ID: <6776@darkstar.ucsc.edu>
Date: 10 Sep 90 16:47:55 GMT
Sender: usenet@darkstar.ucsc.edu
Organization: Southwestern Bell
Lines: 10
Approved: comp-os-research@jupiter.ucsc.edu

I'm looking for references to algorithms for finding cycles in directed
graphs.  I'm going to implement a deadlock detection routine, and since
this is a first for me, I want to sample some of the writings on the
subject.  Although initially I don't intend to differentiate read locks
from write locks (for the purpose of simplifying the deadlock
detection), I would be interested in also reading about those
algorithms as well.  Thanks in advance.

-- 
cunetto@swbatl.sbc.com:		Phillip Cunetto