Path: utzoo!attcan!uunet!lll-winken!lll-tis!ames!mailrus!uwmcsd1!nic.MR.NET!umn-d-ub!umn-cs!mmm!ems!srcsip!ayers
From: ayers@srcsip.UUCP (timingila)
Newsgroups: comp.graphics
Subject: Algorithm for graph display needed please
Message-ID: <8362@srcsip.UUCP>
Date: 9 Sep 88 14:16:32 GMT
Organization: Honeywell SRC, MPLS, MN, 55418
Lines: 12

Could someone please point me to an algorithm for drawing a graph, given a
root node to begin from?  I would like the display to be as uncluttered as
possible.  For example, if two paths converge into one I would like to
ensure that those two paths are drawn beside one another.  And I would like
neat even spacing.
I've come up with routines to draw non-converging graphs (trees) and graphs
that converge to one node, but I don't know how efficient they are compared
to other algorithms.  And I thought before I put too much effort into this
"any random graph" business, I would ask you folks.


Thanks a lot,
tim