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