pretty-printing graphs.

Article View: ut.theory

Article #36

#36

From: Jean-Francois Lamy
Date: Sat, 18 Nov 1989 18:00

7 lines
738 bytes

Does anyone have software or to print out graphs given an adjacency matrix or
some other machine-generated format while trying to minimize cross-overs of
arcs and such aesthetically unpleasant features (anything better than laying
nodes in circle with a mess of lines going across would likely do, really).

Jean-Francois Lamy               lamy@ai.utoronto.ca, uunet!ai.utoronto.ca!lamy
AI Group, Department of Computer Science, University of Toronto, Canada M5S 1A4

Technical Details

Message-ID: <89Nov18.125927est.2782@neat.cs.toronto.edu>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!neat.cs.toronto.edu!lamy

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!neat.cs.toronto.edu!lamy
Newsgroups: ut.theory
From: lamy@ai.utoronto.ca (Jean-Francois Lamy)
Subject: pretty-printing graphs.
Message-ID: <89Nov18.125927est.2782@neat.cs.toronto.edu>
Date: 18 Nov 89 18:00:37 GMT