Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!spool2.mu.edu!sol.ctr.columbia.edu!ursa!jmd
From: jmd@ursa.UUCP (Josh Diamond)
Newsgroups: comp.graphics
Subject: Need algorithm to create network map...
Message-ID: <10774@ursa.UUCP>
Date: 8 Jan 91 19:49:55 GMT
Reply-To: jmd@ursa%ctr.columbia.edu (Spidey!!!)
Organization: Bear Stearns, New York
Lines: 26


Greetings:

     I am trying to find an algorithm for displaying a graph describing
an arbitrary network, with as few crossing links as possible.  That is,
given a list of hosts and networks to which they are attached, I wish
to create a planar map of all the hosts and networks, with the minimum
number of network links crossing each other.

    Does anyone out there know of such an algorithm (or existing code
for creating network maps)?  If so, could you please either send me email,
or post to comp.graphics (email preferred)?


				Thanks in advance...

						Josh Diamond
						AKA Spidey!!!



-- 
 /\ \  / /\  Josh Diamond      / NOTE THE     \       jmd%ursa@ctr.columbia.edu
//\\ .. //\\ AKA Spidey!!!     \ NEW ADDRESS! /   ...!ctr.columbia.edu!ursa!jmd
//\((  ))/\\
/  < `' >  \         Beauty is the purgation of superfluities. -- Michaelangelo