Several libraries of graphs are available for experimenting
graph drawing algorithms.
This
page contents
This suite contains 11,582 undirected graphs, ranging from 10 to 100 vertices, which have been generated from a core set of 112 graphs used in "real life" software engineering and data base applications.
These graphs have been used in the experimental work:
It is composed by one home directory named gfinali which contains 91 subdirectories, one for each cardinality of the graphs in the range 10-100. For example the subdirectory grafocon64nodi contains all graphs with 64 nodes. The files containing the graphs are named as grafo[incremental_code].[number_of_vertices] and are organized as shown here.
To download it just click one of the following lines:
undirected-1.tar.Z (4,218,173 Bytes)
undirected-1.tar.gz (3,067,425 Bytes)
After having transferred the file you have to uncompress it:
> uncompress undirected-1.tar.Z
and then
> tar xvf undirected-1.tar
This suite contains about 1,900 directed acyclic graphs, ranging from 10 to 100 vertices.
These graphs have been used in the experimental work:
It is composed by two directories: random and north which contains 91 subdirectories each, one for each cardinality of the graphs in the range 10-100. For example the subdirectory g64 contains all graphs with 64 nodes. The files containing the graphs are named as g.[number_of_vertices].[incremental_code] and are organized as shown here.
To download it just click the following line (452,315 Bytes):
After having transferred the file you have to uncompress it:
> unzip directed-acyclic-1.tar.gz
and then
> tar xvf directed-acyclic-1.tar