a collection of about 1,890 graph drawings of matrices in the University of Florida Collection. each of the datasets, here sparse matrices is viewed as the adjacency matrix of an undirected graph, which is laid out by a multilevel graph drawing algorithm. if the graph is disconnected, then the largest connected component is drawn. the largest graph in this collection has 8,863,287 vertices & 44,185,251 edges.

[link: research.att.com]