  |
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. |
| |
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. |
| |
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. |
| |
LINK: A Software System for Discrete Mathematics - http://dimacs.rutgers.edu/~berryj/LINK.html
A general-purpose, extendible computing environment in which discrete mathematical objects representing real world problems can be easily manipulated and visualized. |
| |
JGraphT - http://jgrapht.sourceforge.net
Free Java class library that provides mathematical graph-theory objects and algorithms. |
| |
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. |
| |
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. |
| |
GeoSteiner - http://www.diku.dk/geosteiner/
Software for computing Steiner trees. Written in ANSI C, includes the public domain LP-solver lp_solve. |
| |
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. |
| |
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. |
| |
GraphThing - http://graph.seul.org/
Tool for investigating Graph Theory, with a GTK interface. Free under GPL. Unix, source code in C++. |
| |
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. |
| |
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. |
| |
Gato: The Graph Animation Toolbox - http://www.zpr.uni-koeln.de/~gato
Software for visualizing graph algorithms. Free under GPL. Unix, Linux, MacOs ad Windows versions. |