Table 2.

GLay layout algorithms

Fruchterman Reingold (original, grid) (Fruchterman and Reingold, 1991)	Efficient force-based algorithms, with the grid version optimized for large networks
graphopt (GraphOPT http://www.schmuhl.org/graphopt/)	Force-based algorithm with optimization
Kamada kawai	Force-based spring layout
Large graph layout (Adai et al., 2004)	Large graph layout algorithms for connected graphs
Multidimensional scaling (MDS) (Brandes and Pich, 2007)	Layout based on multidimensional scaling based on shortest distances
reingold tilford (hierarchical, circular) (Reingold and Tilford, 1981)	Tree-like layout for connected networks, can be hierarchical or circular from any node as root