Xref: utzoo comp.software-eng:5536 comp.sources.wanted:16558
Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!dali.cs.montana.edu!uakari.primate.wisc.edu!sdd.hp.com!spool.mu.edu!uunet!wang!comm.wang.com!lws
From: lws@comm.wang.com (Lyle Seaman)
Newsgroups: comp.software-eng,comp.sources.wanted
Subject: drawing Directed Acyclic Graphs (algorithm or source)
Message-ID: <1991May7.154518.5156@comm.wang.com>
Date: 7 May 91 15:45:18 GMT
Organization: Wang Labs, Platform Comms.
Lines: 13

I'm putting together a little one-off, and I need an algorithm
(source would be especially nice) that, given a DAG, chooses
chooses a placement of nodes on a plane, such that there is a
minimal number of edge crossings.   Optimal is NOT necessary,
nor is speed.

This is basically the same problem that circuit layout programs
face, only I don't need as high-quality a solution.  

-- 
Lyle 	508 967 2322  		
lws@wang.com 	
Wang Labs, Lowell, MA, USA