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

<strong>Data</strong> All networks from <code>networkrepository.com</code> [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, <em>The Network Data Repository with Interactive Graph Analytics and Visualization</em> (AAAI 2015) <strong>Format</strong> The data format is a simple edge list: each row contains two numbers <em>u</em> and <em>v </em>separated by a space representing an edge <em>{u, v}</em> for a graph with <em>n</em> vertices, the numbers range from <em>0 </em>to <em>n - 1</em> for each edge <em>{u, v} </em>only one of the pairs <em>u v</em> or <em>v u</em> is present, i.e., if the graph has <em>m</em> edges, the file contains <em>m</em> rows