A technique for drawing directed graphs

A four-pass algorithm for drawing directed graphs is presented. The fist pass finds an optimal rank assignment using a network simplex algorithm. The seconds pass sets the vertex order within ranks by an iterative heuristic, incorporating a novel weight function and local transpositions to reduce cr...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on software engineering Vol. 19; no. 3; pp. 214 - 230
Main Authors Gansner, E.R., Koutsofios, E., North, S.C., Vo, K.-P.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.03.1993
Institute of Electrical and Electronics Engineers
IEEE Computer Society
Subjects
Aesthetics
Algorithms
Applied sciences
Automata
Bibliographies
Data structures
Data visualization
Exact sciences and technology
Flow graphs
Flows in networks. Combinatorial problems
Graphs
Heuristic
Iterative algorithms
Mathematical models
Operational research and scientific management
Operational research. Management science
Software engineering
Spline
Studies
Systems development
Graph theory
Algorithm
Simplex method
Directed graph
Heuristic method
Network
Online AccessGet full text

Cover

More Information
Summary:A four-pass algorithm for drawing directed graphs is presented. The fist pass finds an optimal rank assignment using a network simplex algorithm. The seconds pass sets the vertex order within ranks by an iterative heuristic, incorporating a novel weight function and local transpositions to reduce crossings. The third pass finds optimal coordinates for nodes by constructing and ranking an auxiliary graph. The fourth pass makes splines to draw edges. The algorithm creates good drawings and is fast.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0098-5589
1939-3520
DOI:10.1109/32.221135