JDSL 2.0

[JDSL Team]

The JDSL 2.0 Team is pleased to announce the release of JDSL, the Data
Structures Library in Java, version 2.0.  It is available from the
JDSL web site

  http://www.cs.brown.edu/cgc/jdsl/

JDSL 2.0 is a collection of Java interfaces and classes that implement
fundamental data structures and algorithms, such as:

- sequences, trees, priority queues, search trees, hash tables 
- sorting and searching algorithms 
- graphs 
- graph traversals, shortest path, minimum spanning tree

JDSL 2.0 is suitable for use by researchers, professional programmers,
educators, and students. It comes with extensive documentation,
including detailed javadoc, an overview, a tutorial with seven
lessons, and several associated research papers.  It is available free
of charge for noncommercial use.  Commercial licenses are also
offered.

JDSL 2.0 was developed at the Center for Geometric Computing of Brown
University, in collaboration with Algomagic Technologies, Inc.  It is
based on research and educational work led by Michael Goodrich and
Roberto Tamassia.

Comments and questions should be addressed to jdsl at cs.brown.edu.

The JDSL 2.0 Team: - Roberto Tamassia
                   - Michael T. Goodrich
                   - Luca Vismara
                   - Mark Handy
                   - Robert Cohen
                   - Benoit Hudson
                   - Ryan S. Baker
                   - Natasha Gelfand
                   - Galina Shubina
                   - Michael Boilen
                   - Maurizio Pizzonia
                   - Keith Schmidt
                   - Ulrik Brandes
                   - Lucy Perry
                   - Andrew Schwerin



-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html.