GTgraph was developed for the 9th DIMACS Shortest Paths Challenge. The following classes of graphs are currently supported:
Input graph instances used in
- the DARPA HPCS SSCA#2 graph theory benchmark (version 1.0).
- Erdös-Rényi random graphs.
- Small-world graphs, based on the Recursive Matrix (R-MAT) model.
The generators write graphs to disk in the plain text DIMACS Challenge format described here. The file sample.gr contains a sample graph instance.
A brief overview of the generators is described in gen.pdf.
Please see the README for installation and usage of this package.
Please contact Kamesh Madduri or David A. Bader if you encounter any problems building/running the code.