Graph Drawing and Analysis Library and Its Domain-Specific Language for Graphs’ Layout Specifications

Table 1

Times the algorithms need to lay out randomly generated graphs with 1000 vertices and 2000 edges.

Algorithm	Time [ms]
Spring	724
Fruchterman-Reingold	689
Kamada-Kawai	5232
ISOM	461
Fast-organic	9584
Organic	90273
Hierarchical	56100
Symmetric	523
Circular	419
Box	114