Title :
A technique for drawing directed graphs
Author :
Gansner, Emden R. ; Koutsofios, Eleftherios ; North, Stephen C. ; Vo, Gem-Phong
Author_Institution :
AT&T Bell Labs., Murray Hill, NJ, USA
fDate :
3/1/1993 12:00:00 AM
Abstract :
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
Keywords :
computer graphics; directed graphs; optimisation; splines (mathematics); auxiliary graph; directed graphs; four-pass algorithm; iterative heuristic; local transpositions; network simplex algorithm; novel weight function; optimal coordinates; optimal rank assignment; splines; vertex order; Automata; Bibliographies; Data structures; Data visualization; Flow graphs; Iterative algorithms; Spline;
Journal_Title :
Software Engineering, IEEE Transactions on
