Visualization of Clustered Directed Acyclic Graphs without Node Overlapping

Conventional force directed graph drawing methods aim to produce aesthetically pleasing visualization of graphs. The edges of the graph have more or less equal length, and there are as few crossing edges as possible. This paper proposes a new e-spring algorithm for visualizing clustered directed acyclic graphs (DAGs) without node overlapping, extended from the popular spring embedder model. In our framework, nodes are modeled as nonuniform charged particles with weights, and a final drawing is derived by adjusting the positions of the nodes according to a combination of spring forces and repulsive forces derived from electrostatic forces between the nodes. Experimental results and visualization/analysis of this method are reported.