COIN-OR::LEMON - Graph Library

Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • NEWS

    r534 r853  
     12009-10-03 Version 1.1.1 released
     2
     3        Bugfix release.
     4
     5        #295: Suppress MSVC warnings using pragmas
     6        ----: Various CMAKE related improvements
     7              * Remove duplications from doc/CMakeLists.txt
     8              * Rename documentation install folder from 'docs' to 'html'
     9              * Add tools/CMakeLists.txt to the tarball
     10              * Generate and install LEMONConfig.cmake
     11              * Change the label of the html project in Visual Studio
     12              * Fix the check for the 'long long' type
     13              * Put the version string into config.h
     14              * Minor CMake improvements
     15              * Set the version to 'hg-tip' if everything fails
     16        #311: Add missing 'explicit' keywords
     17        #302: Fix the implementation and doc of CrossRefMap
     18        #308: Remove duplicate list_graph.h entry from source list
     19        #307: Bug fix in Preflow and Circulation
     20
     212009-05-13 Version 1.1 released
     22
     23        This is the second stable release of the 1.x series. It
     24        features a better coverage of the tools available in the 0.x
     25        series, a thoroughly reworked LP/MIP interface plus various
     26        improvements in the existing tools.
     27
     28        * Much improved M$ Windows support
     29          * Various improvements in the CMAKE build system
     30          * Compilation warnings are fixed/suppressed
     31        * Support IBM xlC compiler
     32        * New algorithms
     33          * Connectivity related algorithms (#61)
     34          * Euler walks (#65)
     35          * Preflow push-relabel max. flow algorithm (#176)
     36          * Circulation algorithm (push-relabel based) (#175)
     37          * Suurballe algorithm (#47)
     38          * Gomory-Hu algorithm (#66)
     39          * Hao-Orlin algorithm (#58)
     40          * Edmond's maximum cardinality and weighted matching algorithms
     41            in general graphs (#48,#265)
     42          * Minimum cost arborescence/branching (#60)
     43          * Network Simplex min. cost flow algorithm (#234)
     44        * New data structures
     45          * Full graph structure (#57)
     46          * Grid graph structure (#57)
     47          * Hypercube graph structure (#57)
     48          * Graph adaptors (#67)
     49          * ArcSet and EdgeSet classes (#67)
     50          * Elevator class (#174)
     51        * Other new tools
     52          * LP/MIP interface (#44)
     53            * Support for GLPK, CPLEX, Soplex, COIN-OR CLP and CBC
     54          * Reader for the Nauty file format (#55)
     55          * DIMACS readers (#167)
     56          * Radix sort algorithms (#72)
     57          * RangeIdMap and CrossRefMap (#160)
     58        * New command line tools
     59          * DIMACS to LGF converter (#182)
     60          * lgf-gen - a graph generator (#45)
     61          * DIMACS solver utility (#226)
     62        * Other code improvements
     63          * Lognormal distribution added to Random (#102)
     64          * Better (i.e. O(1) time) item counting in SmartGraph (#3)
     65          * The standard maps of graphs are guaranteed to be
     66            reference maps (#190)
     67        * Miscellaneous
     68          * Various doc improvements
     69          * Improved 0.x -> 1.x converter script
     70
     71        * Several bugfixes (compared to release 1.0):
     72          #170: Bugfix SmartDigraph::split()
     73          #171: Bugfix in SmartGraph::restoreSnapshot()
     74          #172: Extended test cases for graphs and digraphs
     75          #173: Bugfix in Random
     76                * operator()s always return a double now
     77                * the faulty real<Num>(Num) and real<Num>(Num,Num)
     78                  have been removed
     79          #187: Remove DijkstraWidestPathOperationTraits
     80          #61:  Bugfix in DfsVisit
     81          #193: Bugfix in GraphReader::skipSection()
     82          #195: Bugfix in ConEdgeIt()
     83          #197: Bugfix in heap unionfind
     84                * This bug affects Edmond's general matching algorithms
     85          #207: Fix 'make install' without 'make html' using CMAKE
     86          #208: Suppress or fix VS2008 compilation warnings
     87          ----: Update the LEMON icon
     88          ----: Enable the component-based installer
     89                (in installers made by CPACK)
     90          ----: Set the proper version for CMAKE in the tarballs
     91                (made by autotools)
     92          ----: Minor clarification in the LICENSE file
     93          ----: Add missing unistd.h include to time_measure.h
     94          #204: Compilation bug fixed in graph_to_eps.h with VS2005
     95          #214,#215: windows.h should never be included by lemon headers
     96          #230: Build systems check the availability of 'long long' type
     97          #229: Default implementation of Tolerance<> is used for integer types
     98          #211,#212: Various fixes for compiling on AIX
     99          ----: Improvements in CMAKE config
     100                - docs is installed in share/doc/
     101                - detects newer versions of Ghostscript
     102          #239: Fix missing 'inline' specifier in time_measure.h
     103          #274,#280: Install lemon/config.h
     104          #275: Prefix macro names with LEMON_ in lemon/config.h
     105          ----: Small script for making the release tarballs added
     106          ----: Minor improvement in unify-sources.sh (a76f55d7d397)
     107
    11082009-03-27 LEMON joins to the COIN-OR initiative
    2109
Note: See TracChangeset for help on using the changeset viewer.