NEWS
author Alpar Juttner <alpar@cs.elte.hu>
Tue, 21 Sep 2010 06:01:30 +0200
branch1.1
changeset 735 dfdb58f52f02
parent 720 86a880ba752d
child 760 f22bc76370b2
permissions -rw-r--r--
Update NEWS file
alpar@735
     1
2010-10-21 Version 1.1.3 released
alpar@735
     2
alpar@735
     3
        Bugfix release.
alpar@735
     4
alpar@735
     5
        #366: Fix Pred[Matrix]MapPath::empty()
alpar@735
     6
        #371: Bug fix in (di)graphCopy()
alpar@735
     7
              The target graph is cleared before adding nodes and arcs/edges.
alpar@735
     8
alpar@735
     9
        #356: Fix multiple execution bug in weighted matchings
alpar@735
    10
        #364: Add missing UndirectedTags
alpar@735
    11
        #368: Fix the usage of std::numeric_limits<>::min() in Network Simplex
alpar@735
    12
        #372: Fix a critical bug in preflow
alpar@735
    13
alpar@720
    14
2010-03-08 Version 1.1.2 released
alpar@720
    15
alpar@720
    16
        Bugfix release.
alpar@720
    17
alpar@720
    18
        #317: Fix (and improve) error message in mip_test.cc
alpar@720
    19
              Remove unnecessary OsiCbc dependency
alpar@720
    20
        #250: Fix in pathSource() and pathTarget()
alpar@720
    21
        #322: Distribute LEMONConfig.cmake.in
alpar@720
    22
        #321: Use pathCopy(from,to) instead of copyPath(to,from)
alpar@720
    23
        #330: Bug fix in map_extender.h
alpar@720
    24
        #335: Fix clear() function in ExtendFindEnum
alpar@720
    25
        #337: Use void* as LPX object pointer
alpar@720
    26
        #336: Fix the date field comment of graphToEps() output
alpar@720
    27
        #323: Bug fix in Suurballe
alpar@720
    28
alpar@692
    29
2009-10-03 Version 1.1.1 released
alpar@692
    30
alpar@692
    31
        Bugfix release.
alpar@692
    32
alpar@692
    33
        #295: Suppress MSVC warnings using pragmas
alpar@692
    34
        ----: Various CMAKE related improvements
alpar@692
    35
              * Remove duplications from doc/CMakeLists.txt
alpar@692
    36
              * Rename documentation install folder from 'docs' to 'html'
alpar@692
    37
              * Add tools/CMakeLists.txt to the tarball
alpar@692
    38
              * Generate and install LEMONConfig.cmake
alpar@692
    39
              * Change the label of the html project in Visual Studio
alpar@692
    40
              * Fix the check for the 'long long' type
alpar@692
    41
              * Put the version string into config.h
alpar@692
    42
              * Minor CMake improvements
alpar@692
    43
              * Set the version to 'hg-tip' if everything fails
alpar@692
    44
        #311: Add missing 'explicit' keywords
alpar@692
    45
        #302: Fix the implementation and doc of CrossRefMap
alpar@692
    46
        #308: Remove duplicate list_graph.h entry from source list
alpar@692
    47
        #307: Bug fix in Preflow and Circulation
alpar@692
    48
alpar@663
    49
2009-05-13 Version 1.1 released
alpar@663
    50
alpar@663
    51
        This is the second stable release of the 1.x series. It
alpar@663
    52
        features a better coverage of the tools available in the 0.x
alpar@663
    53
        series, a thoroughly reworked LP/MIP interface plus various
alpar@663
    54
        improvements in the existing tools.
alpar@663
    55
alpar@663
    56
        * Much improved M$ Windows support
alpar@663
    57
          * Various improvements in the CMAKE build system
alpar@663
    58
          * Compilation warnings are fixed/suppressed
alpar@663
    59
        * Support IBM xlC compiler
alpar@663
    60
        * New algorithms
alpar@663
    61
          * Connectivity related algorithms (#61)
alpar@663
    62
          * Euler walks (#65)
alpar@663
    63
          * Preflow push-relabel max. flow algorithm (#176)
alpar@663
    64
          * Circulation algorithm (push-relabel based) (#175)
alpar@663
    65
          * Suurballe algorithm (#47)
alpar@663
    66
          * Gomory-Hu algorithm (#66)
alpar@663
    67
          * Hao-Orlin algorithm (#58)
alpar@663
    68
          * Edmond's maximum cardinality and weighted matching algorithms
alpar@663
    69
            in general graphs (#48,#265)
alpar@663
    70
          * Minimum cost arborescence/branching (#60)
alpar@663
    71
          * Network Simplex min. cost flow algorithm (#234)
alpar@663
    72
        * New data structures
alpar@663
    73
          * Full graph structure (#57)
alpar@663
    74
          * Grid graph structure (#57)
alpar@663
    75
          * Hypercube graph structure (#57)
alpar@663
    76
          * Graph adaptors (#67)
alpar@663
    77
          * ArcSet and EdgeSet classes (#67)
alpar@663
    78
          * Elevator class (#174)
alpar@663
    79
        * Other new tools
alpar@663
    80
          * LP/MIP interface (#44)
alpar@663
    81
            * Support for GLPK, CPLEX, Soplex, COIN-OR CLP and CBC
alpar@663
    82
          * Reader for the Nauty file format (#55)
alpar@663
    83
          * DIMACS readers (#167)
alpar@663
    84
          * Radix sort algorithms (#72)
alpar@663
    85
          * RangeIdMap and CrossRefMap (#160)
alpar@663
    86
        * New command line tools
alpar@663
    87
          * DIMACS to LGF converter (#182)
alpar@663
    88
          * lgf-gen - a graph generator (#45)
alpar@663
    89
          * DIMACS solver utility (#226)
alpar@663
    90
        * Other code improvements
alpar@663
    91
          * Lognormal distribution added to Random (#102)
alpar@663
    92
          * Better (i.e. O(1) time) item counting in SmartGraph (#3)
alpar@663
    93
          * The standard maps of graphs are guaranteed to be
alpar@663
    94
            reference maps (#190)
alpar@663
    95
        * Miscellaneous
alpar@663
    96
          * Various doc improvements
alpar@663
    97
          * Improved 0.x -> 1.x converter script
alpar@663
    98
alpar@663
    99
        * Several bugfixes (compared to release 1.0):
alpar@663
   100
          #170: Bugfix SmartDigraph::split()
alpar@663
   101
          #171: Bugfix in SmartGraph::restoreSnapshot()
alpar@663
   102
          #172: Extended test cases for graphs and digraphs
alpar@663
   103
          #173: Bugfix in Random
alpar@663
   104
                * operator()s always return a double now
alpar@663
   105
                * the faulty real<Num>(Num) and real<Num>(Num,Num)
alpar@663
   106
                  have been removed
alpar@663
   107
          #187: Remove DijkstraWidestPathOperationTraits
alpar@663
   108
          #61:  Bugfix in DfsVisit
alpar@663
   109
          #193: Bugfix in GraphReader::skipSection()
alpar@663
   110
          #195: Bugfix in ConEdgeIt()
alpar@663
   111
          #197: Bugfix in heap unionfind
alpar@663
   112
                * This bug affects Edmond's general matching algorithms
alpar@663
   113
          #207: Fix 'make install' without 'make html' using CMAKE
alpar@663
   114
          #208: Suppress or fix VS2008 compilation warnings
alpar@663
   115
          ----: Update the LEMON icon
alpar@663
   116
          ----: Enable the component-based installer
alpar@663
   117
                (in installers made by CPACK)
alpar@663
   118
          ----: Set the proper version for CMAKE in the tarballs
alpar@663
   119
                (made by autotools)
alpar@663
   120
          ----: Minor clarification in the LICENSE file
alpar@663
   121
          ----: Add missing unistd.h include to time_measure.h
alpar@663
   122
          #204: Compilation bug fixed in graph_to_eps.h with VS2005
alpar@663
   123
          #214,#215: windows.h should never be included by lemon headers
alpar@663
   124
          #230: Build systems check the availability of 'long long' type
alpar@663
   125
          #229: Default implementation of Tolerance<> is used for integer types
alpar@663
   126
          #211,#212: Various fixes for compiling on AIX
alpar@663
   127
          ----: Improvements in CMAKE config
alpar@663
   128
                - docs is installed in share/doc/
alpar@663
   129
                - detects newer versions of Ghostscript
alpar@663
   130
          #239: Fix missing 'inline' specifier in time_measure.h
alpar@663
   131
          #274,#280: Install lemon/config.h
alpar@663
   132
          #275: Prefix macro names with LEMON_ in lemon/config.h
alpar@663
   133
          ----: Small script for making the release tarballs added
alpar@663
   134
          ----: Minor improvement in unify-sources.sh (a76f55d7d397)
alpar@663
   135
alpar@547
   136
2009-03-27 LEMON joins to the COIN-OR initiative
alpar@547
   137
alpar@547
   138
        COIN-OR (Computational Infrastructure for Operations Research,
alpar@547
   139
        http://www.coin-or.org) project is an initiative to spur the
alpar@547
   140
        development of open-source software for the operations research
alpar@547
   141
        community.
alpar@547
   142
alpar@322
   143
2008-10-13 Version 1.0 released
alpar@262
   144
alpar@262
   145
	This is the first stable release of LEMON. Compared to the 0.x
alpar@262
   146
	release series, it features a considerably smaller but more
alpar@262
   147
	matured set of tools. The API has also completely revised and
alpar@262
   148
	changed in several places.
alpar@262
   149
alpar@322
   150
	* The major name changes compared to the 0.x series (see the
alpar@322
   151
          Migration Guide in the doc for more details)
alpar@262
   152
          * Graph -> Digraph, UGraph -> Graph
alpar@262
   153
          * Edge -> Arc, UEdge -> Edge
alpar@262
   154
	  * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge)
alpar@262
   155
	* Other improvements
alpar@262
   156
	  * Better documentation
alpar@262
   157
	  * Reviewed and cleaned up codebase
alpar@262
   158
	  * CMake based build system (along with the autotools based one)
alpar@262
   159
	* Contents of the library (ported from 0.x)
alpar@262
   160
	  * Algorithms
alpar@262
   161
       	    * breadth-first search (bfs.h)
alpar@262
   162
       	    * depth-first search (dfs.h)
alpar@262
   163
       	    * Dijkstra's algorithm (dijkstra.h)
alpar@262
   164
       	    * Kruskal's algorithm (kruskal.h)
alpar@262
   165
    	  * Data structures
alpar@262
   166
       	    * graph data structures (list_graph.h, smart_graph.h)
alpar@262
   167
       	    * path data structures (path.h)
alpar@262
   168
       	    * binary heap data structure (bin_heap.h)
alpar@262
   169
       	    * union-find data structures (unionfind.h)
alpar@262
   170
       	    * miscellaneous property maps (maps.h)
alpar@262
   171
       	    * two dimensional vector and bounding box (dim2.h)
alpar@262
   172
          * Concepts
alpar@262
   173
       	    * graph structure concepts (concepts/digraph.h, concepts/graph.h,
alpar@262
   174
              concepts/graph_components.h)
alpar@262
   175
       	    * concepts for other structures (concepts/heap.h, concepts/maps.h,
alpar@262
   176
	      concepts/path.h)
alpar@262
   177
    	  * Tools
alpar@262
   178
       	    * Mersenne twister random number generator (random.h)
alpar@262
   179
       	    * tools for measuring cpu and wall clock time (time_measure.h)
alpar@262
   180
       	    * tools for counting steps and events (counter.h)
alpar@262
   181
       	    * tool for parsing command line arguments (arg_parser.h)
alpar@262
   182
       	    * tool for visualizing graphs (graph_to_eps.h)
alpar@262
   183
       	    * tools for reading and writing data in LEMON Graph Format
alpar@262
   184
              (lgf_reader.h, lgf_writer.h)
alpar@262
   185
            * tools to handle the anomalies of calculations with
alpar@262
   186
	      floating point numbers (tolerance.h)
alpar@262
   187
            * tools to manage RGB colors (color.h)
alpar@262
   188
    	  * Infrastructure
alpar@262
   189
       	    * extended assertion handling (assert.h)
alpar@262
   190
       	    * exception classes and error handling (error.h)
alpar@262
   191
      	    * concept checking (concept_check.h)
alpar@262
   192
       	    * commonly used mathematical constants (math.h)