LEDA 3.0  (11/27/1992)



Version 3.0 of the LEDA library of efficient data types and algorithms
is now available from ftp.cs.uni-sb.de (134.96.7.254) /pub/LEDA

Files:
         LEDA-3.0.tar.Z           (template version)
         LEDA-N-3.0.tar.Z         (non-template version)

The most important changes with respect to previous versions are

a) Parameterized data types are realized by templates. In particular, 
   declare macros used in previous versions are obsolete and the syntax 
   for a parameterized data type D with type parameters T1,... ,Tk now 
   is D<T1,...,Tk> (cf. section 1.2 of the user manual). For C++ compilers 
   not supporting templates there is still a non-template variant "LEDA-N" 
   available.

b) Arbitrary data types (not only pointer and simple types) can be used as
   actual type parameters (user manual, section 1.2). 

c) For many of the parameterized data types there exist variants taking an 
   additional data structure parameter for choosing a particular implementation
   (section 1.3 of the manual).

d) The efficiency of many data structures and algorithms has been improved.


   !!! See also the "Changes" file in the LEDA root directory !!!


Stefan Naeher


P.S.

a) This messsage is sent to all members in my list of LEDA users.
   Please let me know if you want to be deleted from the list.

b) The list of (potential) LEDA users is getting longer and longer. But we 
   have no idea what all these people do with it. This information, however,
   is very important for the future development of LEDA. So, if you use LEDA
   in a software project, teaching, experiments, ...  could you please send me 
   some information about it ?  Thank you for the cooperation.