1.1 --- a/NEWS Fri Aug 09 11:07:27 2013 +0200
1.2 +++ b/NEWS Sun Aug 11 15:28:12 2013 +0200
1.3 @@ -1,3 +1,83 @@
1.4 +2010-03-19 Version 1.2 released
1.5 +
1.6 + This is major feature release
1.7 +
1.8 + * New algorithms
1.9 + * Bellman-Ford algorithm (#51)
1.10 + * Minimum mean cycle algorithms (#179)
1.11 + * Karp, Hartman-Orlin and Howard algorithms
1.12 + * New minimum cost flow algorithms (#180)
1.13 + * Cost Scaling algorithms
1.14 + * Capacity Scaling algorithm
1.15 + * Cycle-Canceling algorithms
1.16 + * Planarity related algorithms (#62)
1.17 + * Planarity checking algorithm
1.18 + * Planar embedding algorithm
1.19 + * Schnyder's planar drawing algorithm
1.20 + * Coloring planar graphs with five or six colors
1.21 + * Fractional matching algorithms (#314)
1.22 + * New data structures
1.23 + * StaticDigraph structure (#68)
1.24 + * Several new priority queue structures (#50, #301)
1.25 + * Fibonacci, Radix, Bucket, Pairing, Binomial
1.26 + D-ary and fourary heaps (#301)
1.27 + * Iterable map structures (#73)
1.28 + * Other new tools and functionality
1.29 + * Map utility functions (#320)
1.30 + * Reserve functions are added to ListGraph and SmartGraph (#311)
1.31 + * A resize() function is added to HypercubeGraph (#311)
1.32 + * A count() function is added to CrossRefMap (#302)
1.33 + * Support for multiple targets in Suurballe using fullInit() (#181)
1.34 + * Traits class and named parameters for Suurballe (#323)
1.35 + * Separate reset() and resetParams() functions in NetworkSimplex
1.36 + to handle graph changes (#327)
1.37 + * tolerance() functions are added to HaoOrlin (#306)
1.38 + * Implementation improvements
1.39 + * Improvements in weighted matching algorithms (#314)
1.40 + * Jumpstart initialization
1.41 + * ArcIt iteration is based on out-arc lists instead of in-arc lists
1.42 + in ListDigraph (#311)
1.43 + * Faster add row operation in CbcMip (#203)
1.44 + * Better implementation for split() in ListDigraph (#311)
1.45 + * ArgParser can also throw exception instead of exit(1) (#332)
1.46 + * Miscellaneous
1.47 + * A simple interactive bootstrap script
1.48 + * Doc improvements (#62,#180,#299,#302,#303,#304,#307,#311,#331,#315,
1.49 + #316,#319)
1.50 + * BibTeX references in the doc (#184)
1.51 + * Optionally use valgrind when running tests
1.52 + * Also check ReferenceMapTag in concept checks (#312)
1.53 + * dimacs-solver uses long long type by default.
1.54 + * Several bugfixes (compared to release 1.1):
1.55 + #295: Suppress MSVC warnings using pragmas
1.56 + ----: Various CMAKE related improvements
1.57 + * Remove duplications from doc/CMakeLists.txt
1.58 + * Rename documentation install folder from 'docs' to 'html'
1.59 + * Add tools/CMakeLists.txt to the tarball
1.60 + * Generate and install LEMONConfig.cmake
1.61 + * Change the label of the html project in Visual Studio
1.62 + * Fix the check for the 'long long' type
1.63 + * Put the version string into config.h
1.64 + * Minor CMake improvements
1.65 + * Set the version to 'hg-tip' if everything fails
1.66 + #311: Add missing 'explicit' keywords
1.67 + #302: Fix the implementation and doc of CrossRefMap
1.68 + #308: Remove duplicate list_graph.h entry from source list
1.69 + #307: Bugfix in Preflow and Circulation
1.70 + #305: Bugfix and extension in the rename script
1.71 + #312: Also check ReferenceMapTag in concept checks
1.72 + #250: Bugfix in pathSource() and pathTarget()
1.73 + #321: Use pathCopy(from,to) instead of copyPath(to,from)
1.74 + #322: Distribure LEMONConfig.cmake.in
1.75 + #330: Bug fix in map_extender.h
1.76 + #336: Fix the date field comment of graphToEps() output
1.77 + #323: Bug fix in Suurballe
1.78 + #335: Fix clear() function in ExtendFindEnum
1.79 + #337: Use void* as the LPX object pointer
1.80 + #317: Fix (and improve) error message in mip_test.cc
1.81 + Remove unnecessary OsiCbc dependency
1.82 + #356: Allow multiple executions of weighted matching algorithms (#356)
1.83 +
1.84 2009-05-13 Version 1.1 released
1.85
1.86 This is the second stable release of the 1.x series. It
1.87 @@ -72,7 +152,7 @@
1.88 ----: Minor clarification in the LICENSE file
1.89 ----: Add missing unistd.h include to time_measure.h
1.90 #204: Compilation bug fixed in graph_to_eps.h with VS2005
1.91 - #214,#215: windows.h should never be included by lemon headers
1.92 + #214,#215: windows.h should never be included by LEMON headers
1.93 #230: Build systems check the availability of 'long long' type
1.94 #229: Default implementation of Tolerance<> is used for integer types
1.95 #211,#212: Various fixes for compiling on AIX
1.96 @@ -94,51 +174,51 @@
1.97
1.98 2008-10-13 Version 1.0 released
1.99
1.100 - This is the first stable release of LEMON. Compared to the 0.x
1.101 - release series, it features a considerably smaller but more
1.102 - matured set of tools. The API has also completely revised and
1.103 - changed in several places.
1.104 + This is the first stable release of LEMON. Compared to the 0.x
1.105 + release series, it features a considerably smaller but more
1.106 + matured set of tools. The API has also completely revised and
1.107 + changed in several places.
1.108
1.109 - * The major name changes compared to the 0.x series (see the
1.110 + * The major name changes compared to the 0.x series (see the
1.111 Migration Guide in the doc for more details)
1.112 * Graph -> Digraph, UGraph -> Graph
1.113 * Edge -> Arc, UEdge -> Edge
1.114 - * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge)
1.115 - * Other improvements
1.116 - * Better documentation
1.117 - * Reviewed and cleaned up codebase
1.118 - * CMake based build system (along with the autotools based one)
1.119 - * Contents of the library (ported from 0.x)
1.120 - * Algorithms
1.121 - * breadth-first search (bfs.h)
1.122 - * depth-first search (dfs.h)
1.123 - * Dijkstra's algorithm (dijkstra.h)
1.124 - * Kruskal's algorithm (kruskal.h)
1.125 - * Data structures
1.126 - * graph data structures (list_graph.h, smart_graph.h)
1.127 - * path data structures (path.h)
1.128 - * binary heap data structure (bin_heap.h)
1.129 - * union-find data structures (unionfind.h)
1.130 - * miscellaneous property maps (maps.h)
1.131 - * two dimensional vector and bounding box (dim2.h)
1.132 + * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge)
1.133 + * Other improvements
1.134 + * Better documentation
1.135 + * Reviewed and cleaned up codebase
1.136 + * CMake based build system (along with the autotools based one)
1.137 + * Contents of the library (ported from 0.x)
1.138 + * Algorithms
1.139 + * breadth-first search (bfs.h)
1.140 + * depth-first search (dfs.h)
1.141 + * Dijkstra's algorithm (dijkstra.h)
1.142 + * Kruskal's algorithm (kruskal.h)
1.143 + * Data structures
1.144 + * graph data structures (list_graph.h, smart_graph.h)
1.145 + * path data structures (path.h)
1.146 + * binary heap data structure (bin_heap.h)
1.147 + * union-find data structures (unionfind.h)
1.148 + * miscellaneous property maps (maps.h)
1.149 + * two dimensional vector and bounding box (dim2.h)
1.150 * Concepts
1.151 - * graph structure concepts (concepts/digraph.h, concepts/graph.h,
1.152 + * graph structure concepts (concepts/digraph.h, concepts/graph.h,
1.153 concepts/graph_components.h)
1.154 - * concepts for other structures (concepts/heap.h, concepts/maps.h,
1.155 - concepts/path.h)
1.156 - * Tools
1.157 - * Mersenne twister random number generator (random.h)
1.158 - * tools for measuring cpu and wall clock time (time_measure.h)
1.159 - * tools for counting steps and events (counter.h)
1.160 - * tool for parsing command line arguments (arg_parser.h)
1.161 - * tool for visualizing graphs (graph_to_eps.h)
1.162 - * tools for reading and writing data in LEMON Graph Format
1.163 + * concepts for other structures (concepts/heap.h, concepts/maps.h,
1.164 + concepts/path.h)
1.165 + * Tools
1.166 + * Mersenne twister random number generator (random.h)
1.167 + * tools for measuring cpu and wall clock time (time_measure.h)
1.168 + * tools for counting steps and events (counter.h)
1.169 + * tool for parsing command line arguments (arg_parser.h)
1.170 + * tool for visualizing graphs (graph_to_eps.h)
1.171 + * tools for reading and writing data in LEMON Graph Format
1.172 (lgf_reader.h, lgf_writer.h)
1.173 * tools to handle the anomalies of calculations with
1.174 - floating point numbers (tolerance.h)
1.175 + floating point numbers (tolerance.h)
1.176 * tools to manage RGB colors (color.h)
1.177 - * Infrastructure
1.178 - * extended assertion handling (assert.h)
1.179 - * exception classes and error handling (error.h)
1.180 - * concept checking (concept_check.h)
1.181 - * commonly used mathematical constants (math.h)
1.182 + * Infrastructure
1.183 + * extended assertion handling (assert.h)
1.184 + * exception classes and error handling (error.h)
1.185 + * concept checking (concept_check.h)
1.186 + * commonly used mathematical constants (math.h)