Skip to content
David Schoch edited this page Aug 5, 2019 · 9 revisions

The wiki shows some examples of layouts for large graphs calculated with graphlayouts and compared to some igraph algorithms.

Most graphs are taken from the sparse matrix collection.

runtimes

graph full stress sparse stress (50 pivots) sparse stress (100 pivots) lgl (igraph) mds (igraph) pivot mds (50 pivots) pivot mds (100 pivots)
power grid 134s 3.4s 5.6s 11.5s 114s 1s 1.1s
3elt 113s 3.4s 5.2s 16.6s 95s 1s 1.1s
Clone this wiki locally