An Algebraic Combinatorics Environment for MAPLE providing functions to work with classical structures in algebraic combinatorics. Free download.

Using combinatorics to solve structured linear systems of equations.

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.

Software for visualizing graph algorithms. Free under GPL. Unix, Linux, MacOs and Windows versions.

Software for computing Steiner trees. Written in ANSI C, includes the public domain LP-solver lp_solve.

C++ library of graph optimization algorithms with a GUI for editing, running and tracing the algorithms.

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.

By using the DSATUR algorithm, this php/form colors any graph in the Dimacs format.

A tool for graph theory, having a generator and offering various algorithms: shortest paths, network flows, maximal clique, optimal coloring etc.

Three algorithms written in NESL for finding separators of graphs, in order to compare the quality of the cuts.

Tool for investigating Graph Theory, with a GTK interface. Free under GPL. Unix, source code in C++.

A set of small utilities realizing theoretical graph algorithms (including tree algorithms). The utilities work with simple text input/output formats.

A java applet for researching what is known about particular graph classes.

Provides a fast graphisomorphism algorithm written in object-oriented Java using the popular yfiles graph library. The ITGI algorithm can be freely downloaded.

Free Java class library that provides mathematical graph-theory objects and algorithms.