# The CS Program

CS is a MuPAD package for counting and randomly generating
combinatorial structures, developed in the INRIA
Polka project in Nancy,
in LaBRI in Bordeaux
and LRI in Orsay.

- Here is a demonstration (April 10, 1998)
[postscript |
pdf]
of the capabilities of CS.
- The C programs automatically produced by CS use floating-point interval arithmetic.
This is the first implementation of one of the algorithms given by
A. Denise and P. Zimmermann, Theoretical Computer Science 218 (1999)
233-248.

(Preliminary version: INRIA Report 3242, September 1997.)

For using CS, you have to:
- install MuPAD (version 1.3, 1.4 or 1.4.1)
on your site,
- and download the file cs.mu
(and, if you want, the file cs.test).

The current version of CS is version 1.4.
You can find here all the previous versions of the file cs.mu.
Here are some examples of

automatically produced by CS for the random generation of general trees. You can see below
a general tree of size 250:

Such a figure can be drawn by using
CalICo or
CGraph,
two programs dedicated to the manipulation and visualization of combinatorial structures. This figure above was drawn with CalICo.
### Others combinatorics packages

- COMBSTRUCT, developed in the INRIA
Algo project in Paris.
- qAlGO (still in french, sorry), developed at LaBRI, University Bordeaux I. (source here)
- ACE, developed at the University of Marne-la-Vallée.

Comments, remarks, bugs reports:
cs@labri.u-bordeaux.fr

Isabelle.Dutour@labri.u-bordeaux.fr
Last modification: November 9 1999