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.
Free Software in Graph Theory
- http://www.geocities.com/pechv_ru/
- Free Software for Win 9X,NT on Graph Theory by Vitali Petchenkine. Procedures: Metrics of the graph; Paths and cycles; Colorations; Automorphism group; Minimal spanning tree; Shortest paths; Max. Capacity path; K Shortest paths; Salesman problem; Maximal flow; Critical path; Reports for Graphs; Print.
GRAPE
- http://www.maths.qmul.ac.uk/~leonard/grape/
- A GAP package for computing with graphs; primarily designed for the efficient construction and analysis of graphs related to groups, combinatorial designs and finite geometries.
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.
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.
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.
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.
