A TECHNIQUE FOR DRAWING DIRECTED-GRAPHS

被引：309

作者：

GANSNER, ER

KOUTSOFIOS, E

NORTH, SC

VO, KP

机构：

[1] AT&T Bell Laboratories, Murray Hill

来源：

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING | 1993年 / 19卷 / 03期

关键词：

DIRECTED GRAPH LAYOUT ALGORITHM; NETWORK SIMPLEX;

D O I：

10.1109/32.221135

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We describe a four-pass algorithm for drawing directed graphs. The first pass finds an optimal rank assignment using a network simplex algorithm. The second 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 makes good drawings and runs fast.

引用

页码：214 / 230

页数：17

共 18 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER

[2]

CARPANO M, 1980, IEEE T SOFTWARE ENG, V12, P538

[3]

CHVATAL V, 1976, MATH PROGRAM, V11, P105

[4] ALGORITHMS FOR PLANE REPRESENTATIONS OF ACYCLIC DIGRAPHS [J].

DIBATTISTA, G ;

TAMASSIA, R .

THEORETICAL COMPUTER SCIENCE, 1988, 61 (2-3) :175-198

[5]

EADES P, 1977, IEEE T SYST MAN CYB, V7, P505

[6]

Eades P., 1986, 69 U QUEENSL DEP COM

[7]

Freeman H., 1987, INT J PATTERN RECOGN, V1, P121

[8]

GANSNER ER, UNPUB

[9]

GANSNER ER, 1988, SOFTWARE PRACTICE EX, V17, P1047

[10]

Garey R., 1979, COMPUTERS INTRACTABI

← 1 2 →