  |
Combinatorics Software of the Algorithms Project - http://algo.inria.fr/libraries/software.html
Combinatorial analysis, discrete mathematics and computer algebra are the main interests of the Algorithms Projects. The packages let you define combinatorial structures; manipulate the associated generating functions, functional equations or recurrences; study their asymptotic behaviour. |
| |
NetworkX - http://networkx.lanl.gov/
NetworkX (NX) is a Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks. |
| |
http://cs.anu.edu.au/~bdm/nauty/ - http://cs.anu.edu.au/~bdm/nauty/
A program for computing automorphism groups of graphs and digraphs. It can also produce a canonical labelling. |
| |
The LEDA Library - http://www.mpi-sb.mpg.de/LEDA/leda.html
LEDA is a library of the data types and algorithms of combinatorial computing. |
| |
SF, Posets and Coxeter/Weyl - http://www.math.lsa.umich.edu/~jrs/maple.html
John Stembridge's Maple packages for symmetric functions, posets, root systems, and finite Coxeter groups. |
| |
Algorithms and Software for Partitioning Meshes - http://www.cs.sandia.gov/CRF/chac.html
Using combinatorics to solve structured linear systems of equations. |
| |
Graph Partitioners - http://www.cs.cmu.edu/~scandal/alg/separator.html
Three algorithms written in NESL for finding separators of graphs, in order to compare the quality of the cuts. |
| |
Graph Magics - http://www.graph-magics.com
A tool for graph theory, having a generator and offering various algorithms: shortest paths, network flows, maximal clique, optimal coloring etc. |
| |
GraphThing - http://graph.seul.org/
Tool for investigating Graph Theory, with a GTK interface. Free under GPL. Unix, source code in C++. |
| |
GOBLIN Graph Library - http://www.math.uni-augsburg.de/opt/goblin.html
C++ library of graph optimization algorithms with a GUI for editing, running and tracing the algorithms. |
| |
http://phalanstere.univ-mlv.fr/~ace/ACE/3.0/ACE.html - http://phalanstere.univ-mlv.fr/~ace/ACE/3.0/ACE.html
An Algebraic Combinatorics Environment for MAPLE providing functions to work with classical structures in algebraic combinatorics. Free download. |
| |
graph-utils - http://graph-utils.sourceforge.net
A set of small utilities realizing theoretical graph algorithms (including tree algorithms). The utilities work with simple text input/output formats. |
| |
Graph Coloring By DSATUR - http://prolland.free.fr/works/research/dsatphp/dsat.html
By using the DSATUR algorithm, this php/form colors any graph in the Dimacs format. |
 |
SCL - Star Complement Library - http://www.math.rs/~zstanic/scl.htm
A program for computing the maximal graphs using the star complement technique including programs for computing the maximal cliques and the isomorphism classes of graphs. |
| |
plantri and fullgen - http://cs.anu.edu.au/people/bdm/plantri/
Programs for generation of certain types of planar graph, generated in such a way that exactly one member of each isomorphism class is output without the need for storing them. |