almost 3000 Networks (unweighted, undirected, simple, connected) from Network Repository

Data

All networks from networkrepository.com [1] with at most 1M edges (fall 2020) with the following modifications:

weights and edge directions have been ignored

multi-edges and self loops have been removed, i.e., the graphs are simple

each graph has been reduced to its largest connected component

for isomorphic graphs, only one copy has been kept

[1] Ryan A. Rossi and Nesreen K. Ahmed, The Network Data Repository with Interactive Graph Analytics and Visualization (AAAI 2015)

Format

The data format is a simple edge list:

each row contains two numbers u and v separated by a space representing an edge {u, v}

for a graph with n vertices, the numbers range from 0 to n - 1

for each edge {u, v} only one of the pairs u v or v u is present, i.e., if the graph has m edges, the file contains m rows