The AsciiGraph format

Overview

The AsciiGraph format is a simple, inefficient format that can be used to import graphs into WebGraph format. Graphs expressed in AsciiGraph format should have filenames that end in .graph-txt. The first line of the file should be the number of vertices; each subsequent line i should contain the successors of the i-1'th vertex, in ascending order. The index of each vertex should be considered to be the line (of the file) in which their successor list appears, minus 1 (since the first line of the file, where the node count appears, does not count).

For example, consider a graph of three vertices, a, b, and c, consisting of the following edges:

(a, b)
(a, c)
(b, c)
(b, a)

This graph could be expressed by the following AsciiGraph, assuming we assign the vertex indices a = 0, b = 1, and c = 2:

3
1 2
0 2

(Note the blank last line, as the vertex c has no successors).

Click here for a random graph of 100 vertices, in AsciiGraph format.