Experimental Results and Software
The package graph.tar.gz contains a maxflow solver, that uses different graphs, such as
the static bidirectional graph, the static opposite graph or the standard LEDA graph.
The following list is a collection of public available generators for network problems.
Maxflow Problem generators
|genrmf||by C. Badics - random frames|
|tg||by G. Waissi and J. Setubal - transit grid|
|ak||by B. Cherkassky and A. V. Goldberg - ak|
|wash||by R. Andersen et al. - several types of graphs|
|ac||by G. Waissi - acyclic graphs|
Some generators were collected and provided by the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS).