Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!rutgers!apple!well!shf
From: shf@well.UUCP (Stuart H. Ferguson)
Newsgroups: comp.graphics
Subject: Re: directed graph drawing algorithm
Keywords: directed graph
Message-ID: <11365@well.UUCP>
Date: 19 Apr 89 04:56:14 GMT
References: <6900@saturn.ucsc.edu>
Reply-To: shf@well.UUCP (Stuart H. Ferguson)
Organization: The Blue Planet
Lines: 17

+-- skinner@saturn.ucsc.edu (Robert Skinner) writes:
| Some time ago someone posted a program that drew directed (acyclic?)
| graphs with a minimum of tangled arcs.  Of course, I wasn't interested
| then, but I am now.

I know the feeling.

|  Could some kind soul please mail it to me?
| thanks in advance

Me too, please.  Unless the graphs have to be acyclic or it takes greater
than polynomial time, in which case save the postage.

Thanx.
-- 
		Stuart Ferguson		(shf@well.UUCP)
		Action by HAVOC