Path: utzoo!utgpu!watmath!att!bellcore!rutgers!cs.utexas.edu!csd4.milw.wisc.edu!bbn!diamond.bbn.com!gherrera
From: gherrera@bbn.com (Ta Herrera)
Newsgroups: comp.ai
Subject: Seeking graphical network algorithm
Message-ID: <12948@opal.BBN.COM>
Date: 8 Aug 89 22:14:24 GMT
Reply-To: gherrera@bbn.com (Ta Herrera)
Organization: BBN Laboratories Incorporated, Cambridge, MA
Lines: 18
References:

I'm trying to create a 2-D graphical depiction of a network of nodes
with an arbitrary number of interconnections.  Does anyone out there
know of an algorithm which reads a list of numbered (named) nodes and
their connections (i.e an arbitrary number of names of other nodes),
then creates the simplest possible "web" given this information?  The
information would be returned as, say, a list of the nodes and their
coordinates.

If you know of such an algorithm, please email me (a reference or source
if possible) at the address below.

Thanks,

Ta
======================================================================
Ta Herrera (gherrera@diamond.BBN.COM)
BBN Systems & Technologies Corp.
Cambridge, MA 02138