NEWS
author Alpar Juttner <alpar@cs.elte.hu>
Mon, 08 Aug 2011 13:13:03 +0200
branch1.2
changeset 1084 d303bfa8b1ed
parent 1005 ffc2d2559fc9
child 1099 1086d1c28303
permissions -rw-r--r--
Unify sources
alpar@1083
     1
2011-08-08 Version 1.2.2 released
alpar@1083
     2
alpar@1083
     3
        Bugfix release.
alpar@1083
     4
alpar@1083
     5
        #392: Bug fix in Dfs::start(s,t)
alpar@1083
     6
        #414: Fix wrong initialization in Preflow
alpar@1083
     7
        #404: Update Doxygen configuration
alpar@1083
     8
        #416: Support tests with valgrind
alpar@1083
     9
        #418: Better Win CodeBlock/MinGW support
alpar@1083
    10
        #419: Backport build environment improvements from the main branch
alpar@1083
    11
              - Build of mip_test and lp_test precede the running of the tests
alpar@1083
    12
              - Also search for coin libs under ${COIN_ROOT_DIR}/lib/coin
alpar@1083
    13
              - Do not look for COIN_VOL libraries
alpar@1083
    14
        #382: Allow lgf file without Arc maps
alpar@1083
    15
        #417: Bug fix in CostScaling
alpar@1083
    16
alpar@1005
    17
2010-10-21 Version 1.2.1 released
alpar@1005
    18
alpar@1005
    19
        Bugfix release.
alpar@1005
    20
alpar@1005
    21
        #366: Fix Pred[Matrix]MapPath::empty()
alpar@1005
    22
        #371: Bug fix in (di)graphCopy()
alpar@1005
    23
              The target graph is cleared before adding nodes and arcs/edges.
alpar@1005
    24
alpar@1005
    25
        #364: Add missing UndirectedTags
alpar@1005
    26
        #368: Fix the usage of std::numeric_limits<>::min() in Network Simplex
alpar@1005
    27
        #372: Fix a critical bug in preflow
alpar@1005
    28
alpar@962
    29
2010-03-19 Version 1.2 released
alpar@962
    30
alpar@962
    31
        This is major feature release
alpar@962
    32
alpar@962
    33
        * New algorithms
alpar@962
    34
          * Bellman-Ford algorithm (#51)
alpar@962
    35
          * Minimum mean cycle algorithms (#179)
alpar@962
    36
            * Karp, Hartman-Orlin and Howard algorithms
alpar@962
    37
          * New minimum cost flow algorithms (#180)
alpar@962
    38
            * Cost Scaling algorithms
alpar@962
    39
            * Capacity Scaling algorithm
alpar@962
    40
            * Cycle-Canceling algorithms
alpar@962
    41
          * Planarity related algorithms (#62)
alpar@962
    42
            * Planarity checking algorithm
alpar@962
    43
            * Planar embedding algorithm
alpar@962
    44
            * Schnyder's planar drawing algorithm
alpar@962
    45
            * Coloring planar graphs with five or six colors
alpar@962
    46
          * Fractional matching algorithms (#314)
alpar@962
    47
        * New data structures
alpar@962
    48
          * StaticDigraph structure (#68)
alpar@962
    49
          * Several new priority queue structures (#50, #301)
alpar@962
    50
            * Fibonacci, Radix, Bucket, Pairing, Binomial
alpar@962
    51
              D-ary and fourary heaps (#301)
alpar@962
    52
          * Iterable map structures (#73)
alpar@962
    53
        * Other new tools and functionality
alpar@962
    54
          * Map utility functions (#320)
alpar@962
    55
          * Reserve functions are added to ListGraph and SmartGraph (#311)
alpar@962
    56
          * A resize() function is added to HypercubeGraph (#311)
alpar@962
    57
          * A count() function is added to CrossRefMap (#302)
alpar@962
    58
          * Support for multiple targets in Suurballe using fullInit() (#181)
alpar@962
    59
          * Traits class and named parameters for Suurballe (#323)
alpar@962
    60
          * Separate reset() and resetParams() functions in NetworkSimplex
alpar@962
    61
            to handle graph changes (#327)
alpar@962
    62
          * tolerance() functions are added to HaoOrlin (#306)
alpar@962
    63
        * Implementation improvements
alpar@962
    64
          * Improvements in weighted matching algorithms (#314)
alpar@962
    65
            * Jumpstart initialization
alpar@962
    66
          * ArcIt iteration is based on out-arc lists instead of in-arc lists
alpar@962
    67
            in ListDigraph (#311)
alpar@962
    68
          * Faster add row operation in CbcMip (#203)
alpar@962
    69
          * Better implementation for split() in ListDigraph (#311)
alpar@962
    70
          * ArgParser can also throw exception instead of exit(1) (#332)
alpar@962
    71
        * Miscellaneous
alpar@962
    72
          * A simple interactive bootstrap script
alpar@962
    73
          * Doc improvements (#62,#180,#299,#302,#303,#304,#307,#311,#331,#315,
alpar@962
    74
                #316,#319)
alpar@962
    75
            * BibTeX references in the doc (#184)
alpar@962
    76
          * Optionally use valgrind when running tests
alpar@962
    77
          * Also check ReferenceMapTag in concept checks (#312)
alpar@962
    78
          * dimacs-solver uses long long type by default.
alpar@962
    79
        * Several bugfixes (compared to release 1.1):
alpar@962
    80
          #295: Suppress MSVC warnings using pragmas
alpar@962
    81
          ----: Various CMAKE related improvements
alpar@962
    82
                * Remove duplications from doc/CMakeLists.txt
alpar@962
    83
                * Rename documentation install folder from 'docs' to 'html'
alpar@962
    84
                * Add tools/CMakeLists.txt to the tarball
alpar@962
    85
                * Generate and install LEMONConfig.cmake
alpar@962
    86
                * Change the label of the html project in Visual Studio
alpar@962
    87
                * Fix the check for the 'long long' type
alpar@962
    88
                * Put the version string into config.h
alpar@962
    89
                * Minor CMake improvements
alpar@962
    90
                * Set the version to 'hg-tip' if everything fails
alpar@962
    91
          #311: Add missing 'explicit' keywords
alpar@962
    92
          #302: Fix the implementation and doc of CrossRefMap
alpar@962
    93
          #308: Remove duplicate list_graph.h entry from source list
alpar@962
    94
          #307: Bugfix in Preflow and Circulation
alpar@962
    95
          #305: Bugfix and extension in the rename script
alpar@962
    96
          #312: Also check ReferenceMapTag in concept checks
alpar@962
    97
          #250: Bugfix in pathSource() and pathTarget()
alpar@962
    98
          #321: Use pathCopy(from,to) instead of copyPath(to,from)
alpar@962
    99
          #322: Distribure LEMONConfig.cmake.in
alpar@962
   100
          #330: Bug fix in map_extender.h
alpar@962
   101
          #336: Fix the date field comment of graphToEps() output
alpar@962
   102
          #323: Bug fix in Suurballe
alpar@962
   103
          #335: Fix clear() function in ExtendFindEnum
alpar@962
   104
          #337: Use void* as the LPX object pointer
alpar@962
   105
          #317: Fix (and improve) error message in mip_test.cc
alpar@962
   106
                Remove unnecessary OsiCbc dependency
alpar@962
   107
          #356: Allow multiple executions of weighted matching algorithms (#356)
alpar@962
   108
alpar@712
   109
2009-05-13 Version 1.1 released
alpar@712
   110
alpar@712
   111
        This is the second stable release of the 1.x series. It
alpar@712
   112
        features a better coverage of the tools available in the 0.x
alpar@712
   113
        series, a thoroughly reworked LP/MIP interface plus various
alpar@712
   114
        improvements in the existing tools.
alpar@712
   115
alpar@712
   116
        * Much improved M$ Windows support
alpar@712
   117
          * Various improvements in the CMAKE build system
alpar@712
   118
          * Compilation warnings are fixed/suppressed
alpar@712
   119
        * Support IBM xlC compiler
alpar@712
   120
        * New algorithms
alpar@712
   121
          * Connectivity related algorithms (#61)
alpar@712
   122
          * Euler walks (#65)
alpar@712
   123
          * Preflow push-relabel max. flow algorithm (#176)
alpar@712
   124
          * Circulation algorithm (push-relabel based) (#175)
alpar@712
   125
          * Suurballe algorithm (#47)
alpar@712
   126
          * Gomory-Hu algorithm (#66)
alpar@712
   127
          * Hao-Orlin algorithm (#58)
alpar@712
   128
          * Edmond's maximum cardinality and weighted matching algorithms
alpar@712
   129
            in general graphs (#48,#265)
alpar@712
   130
          * Minimum cost arborescence/branching (#60)
alpar@712
   131
          * Network Simplex min. cost flow algorithm (#234)
alpar@712
   132
        * New data structures
alpar@712
   133
          * Full graph structure (#57)
alpar@712
   134
          * Grid graph structure (#57)
alpar@712
   135
          * Hypercube graph structure (#57)
alpar@712
   136
          * Graph adaptors (#67)
alpar@712
   137
          * ArcSet and EdgeSet classes (#67)
alpar@712
   138
          * Elevator class (#174)
alpar@712
   139
        * Other new tools
alpar@712
   140
          * LP/MIP interface (#44)
alpar@712
   141
            * Support for GLPK, CPLEX, Soplex, COIN-OR CLP and CBC
alpar@712
   142
          * Reader for the Nauty file format (#55)
alpar@712
   143
          * DIMACS readers (#167)
alpar@712
   144
          * Radix sort algorithms (#72)
alpar@712
   145
          * RangeIdMap and CrossRefMap (#160)
alpar@712
   146
        * New command line tools
alpar@712
   147
          * DIMACS to LGF converter (#182)
alpar@712
   148
          * lgf-gen - a graph generator (#45)
alpar@712
   149
          * DIMACS solver utility (#226)
alpar@712
   150
        * Other code improvements
alpar@712
   151
          * Lognormal distribution added to Random (#102)
alpar@712
   152
          * Better (i.e. O(1) time) item counting in SmartGraph (#3)
alpar@712
   153
          * The standard maps of graphs are guaranteed to be
alpar@712
   154
            reference maps (#190)
alpar@712
   155
        * Miscellaneous
alpar@712
   156
          * Various doc improvements
alpar@712
   157
          * Improved 0.x -> 1.x converter script
alpar@712
   158
alpar@712
   159
        * Several bugfixes (compared to release 1.0):
alpar@712
   160
          #170: Bugfix SmartDigraph::split()
alpar@712
   161
          #171: Bugfix in SmartGraph::restoreSnapshot()
alpar@712
   162
          #172: Extended test cases for graphs and digraphs
alpar@712
   163
          #173: Bugfix in Random
alpar@712
   164
                * operator()s always return a double now
alpar@712
   165
                * the faulty real<Num>(Num) and real<Num>(Num,Num)
alpar@712
   166
                  have been removed
alpar@712
   167
          #187: Remove DijkstraWidestPathOperationTraits
alpar@712
   168
          #61:  Bugfix in DfsVisit
alpar@712
   169
          #193: Bugfix in GraphReader::skipSection()
alpar@712
   170
          #195: Bugfix in ConEdgeIt()
alpar@712
   171
          #197: Bugfix in heap unionfind
alpar@712
   172
                * This bug affects Edmond's general matching algorithms
alpar@712
   173
          #207: Fix 'make install' without 'make html' using CMAKE
alpar@712
   174
          #208: Suppress or fix VS2008 compilation warnings
alpar@712
   175
          ----: Update the LEMON icon
alpar@712
   176
          ----: Enable the component-based installer
alpar@712
   177
                (in installers made by CPACK)
alpar@712
   178
          ----: Set the proper version for CMAKE in the tarballs
alpar@712
   179
                (made by autotools)
alpar@712
   180
          ----: Minor clarification in the LICENSE file
alpar@712
   181
          ----: Add missing unistd.h include to time_measure.h
alpar@712
   182
          #204: Compilation bug fixed in graph_to_eps.h with VS2005
alpar@962
   183
          #214,#215: windows.h should never be included by LEMON headers
alpar@712
   184
          #230: Build systems check the availability of 'long long' type
alpar@712
   185
          #229: Default implementation of Tolerance<> is used for integer types
alpar@712
   186
          #211,#212: Various fixes for compiling on AIX
alpar@712
   187
          ----: Improvements in CMAKE config
alpar@712
   188
                - docs is installed in share/doc/
alpar@712
   189
                - detects newer versions of Ghostscript
alpar@712
   190
          #239: Fix missing 'inline' specifier in time_measure.h
alpar@712
   191
          #274,#280: Install lemon/config.h
alpar@712
   192
          #275: Prefix macro names with LEMON_ in lemon/config.h
alpar@712
   193
          ----: Small script for making the release tarballs added
alpar@712
   194
          ----: Minor improvement in unify-sources.sh (a76f55d7d397)
alpar@712
   195
alpar@534
   196
2009-03-27 LEMON joins to the COIN-OR initiative
alpar@534
   197
alpar@534
   198
        COIN-OR (Computational Infrastructure for Operations Research,
alpar@534
   199
        http://www.coin-or.org) project is an initiative to spur the
alpar@534
   200
        development of open-source software for the operations research
alpar@534
   201
        community.
alpar@534
   202
alpar@322
   203
2008-10-13 Version 1.0 released
alpar@262
   204
alpar@962
   205
        This is the first stable release of LEMON. Compared to the 0.x
alpar@962
   206
        release series, it features a considerably smaller but more
alpar@962
   207
        matured set of tools. The API has also completely revised and
alpar@962
   208
        changed in several places.
alpar@262
   209
alpar@962
   210
        * The major name changes compared to the 0.x series (see the
alpar@322
   211
          Migration Guide in the doc for more details)
alpar@262
   212
          * Graph -> Digraph, UGraph -> Graph
alpar@262
   213
          * Edge -> Arc, UEdge -> Edge
alpar@962
   214
          * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge)
alpar@962
   215
        * Other improvements
alpar@962
   216
          * Better documentation
alpar@962
   217
          * Reviewed and cleaned up codebase
alpar@962
   218
          * CMake based build system (along with the autotools based one)
alpar@962
   219
        * Contents of the library (ported from 0.x)
alpar@962
   220
          * Algorithms
alpar@962
   221
            * breadth-first search (bfs.h)
alpar@962
   222
            * depth-first search (dfs.h)
alpar@962
   223
            * Dijkstra's algorithm (dijkstra.h)
alpar@962
   224
            * Kruskal's algorithm (kruskal.h)
alpar@962
   225
          * Data structures
alpar@962
   226
            * graph data structures (list_graph.h, smart_graph.h)
alpar@962
   227
            * path data structures (path.h)
alpar@962
   228
            * binary heap data structure (bin_heap.h)
alpar@962
   229
            * union-find data structures (unionfind.h)
alpar@962
   230
            * miscellaneous property maps (maps.h)
alpar@962
   231
            * two dimensional vector and bounding box (dim2.h)
alpar@262
   232
          * Concepts
alpar@962
   233
            * graph structure concepts (concepts/digraph.h, concepts/graph.h,
alpar@262
   234
              concepts/graph_components.h)
alpar@962
   235
            * concepts for other structures (concepts/heap.h, concepts/maps.h,
alpar@962
   236
              concepts/path.h)
alpar@962
   237
          * Tools
alpar@962
   238
            * Mersenne twister random number generator (random.h)
alpar@962
   239
            * tools for measuring cpu and wall clock time (time_measure.h)
alpar@962
   240
            * tools for counting steps and events (counter.h)
alpar@962
   241
            * tool for parsing command line arguments (arg_parser.h)
alpar@962
   242
            * tool for visualizing graphs (graph_to_eps.h)
alpar@962
   243
            * tools for reading and writing data in LEMON Graph Format
alpar@262
   244
              (lgf_reader.h, lgf_writer.h)
alpar@262
   245
            * tools to handle the anomalies of calculations with
alpar@962
   246
              floating point numbers (tolerance.h)
alpar@262
   247
            * tools to manage RGB colors (color.h)
alpar@962
   248
          * Infrastructure
alpar@962
   249
            * extended assertion handling (assert.h)
alpar@962
   250
            * exception classes and error handling (error.h)
alpar@962
   251
            * concept checking (concept_check.h)
alpar@962
   252
            * commonly used mathematical constants (math.h)