Graphs are ordered by size, with the first being the smallest (10K edges) the latest being the largest (1.5M edges); please refer to the archive to find out the exact sizes.

The following gallery contains drawings of graphs made with the Fruchterman-Reingold force model. The colouring is based on the vertices degree, from orange (lower degree) to white to purple (higher degree).

add32 - 5K V, 10K E.

5K vertices, 10K edges.

PGPGiantCompo - 10K V, 24K E

10K vertices, 24K edges. E-Mail network.

CA-GrQc - 5K V, 15K E

5K vertices, 15K edges. Collaboration network.

Grund - 15K V, 17K E

15K vertices, 17K edges. Economical problem.

CA-CondMat - 23K V, 93K E

23K vertices, 93K edges. Collaboration network.

P2P-Gnutella04 - 11K V, 40K E

11K vertices, 40K edges. P2P network.

P2P-Gnutella31 - 62K V, 150K E

62K vertices, 150K edges. P2P network.

ASIC-320 - 300K V, 500K E

300K vertices, 500K edges. Circuit simulation problem.

Amazon0302 - 300K V, 890K E

300K vertices, 890K edges. Amazon co-purchasing network.

Amazon - 300K V, 925K E

300k vertices, 925K edges. Amazon co-purchasing network.

This gallery contains drawings of graphs made with the LinLog force model. The colouring is based on a K-Means clustering. Bigger vertices have higher degree than smaller ones.

add32 - 5K V, 10K E

5K vertices, 10K edges.

PGPGiantCompo - 10K V, 24K E

10K vertices, 24K edges. E-Mail connection network.

CA-GrQc - 5K V, 15K E

5K vertices, 15K edges. Collaboration Network.

Grund - 15K V, 17K E

15K vertices, 17K edges. Economical problem.

CA-CondMat - 23K V, 100K E

23K vertices, 100K edges. Collaboration Network.

P2P-Gnutella04 - 11K V, 40K E

11K vertices, 40K edges. P2P network.

P2P-Gnutella31 - 63K V, 150K E

63K vertices, 150K edges. P2P network.