ECL graphs (*.egr) are stored in binary CSR format. We have used the following codes to convert graphs to this format.
These codes are not very robust and may not work. However, they should make it easy to write your own converter if necessary.
Note that these codes are protected by this license and that by downloading any of them you agree
to the terms and conditions set forth in this license.
Dimacs to ECL graph converter: dimacs2ecl.cpp
MatrixMarket to ECL graph converter: mm2ecl.cpp
Lonestar to ECL graph converter: lsg2ecl.cpp
SNAP to ECL graph converter: snap2ecl.cpp
Header file to read in ECL graphs: ECLgraph.h
You can use the following links to download some sample graphs in ECL format. They are all undirected (i.e., symmetric) and do not contain loops (self-edges). Some have edge weights, none of which are negative or zero.
These graphs stem from the Center for Discrete Mathematics and Theoretical Computer Science at the University of Rome (Dimacs) http://www.dis.uniroma1.it/challenge9/download.shtml, the Galois framework (Galois) http://iss.ices.utexas.edu/projects/galois/downloads/Galois-2.3.0.tar.bz2, the Stanford Network Analysis Platform (SNAP) https://snap.stanford.edu/data/, and the SuiteSparse Matrix Collection (SSMC) https://sparse.tamu.edu/.
This work has been supported in part by the National Science Foundation under Grant No. 1406304 as well as by equipment donations from Nvidia Corporation.