Changes in NEWS [934:1086d1c28303:665:e652b6f9a29f] in lemon-1.2
Legend:
- Unmodified
- Added
- Removed
-
NEWS
r934 r665 1 2011-11-09 Version 1.2.3 released2 3 Bugfix release.4 5 #428: Add missing lemon/lemon.pc.cmake to the release tarball6 #429: Fix VS warnings7 #430: Fix LpBase::Constr two-side limit bug8 9 2011-08-08 Version 1.2.2 released10 11 Bugfix release.12 13 #392: Bug fix in Dfs::start(s,t)14 #414: Fix wrong initialization in Preflow15 #404: Update Doxygen configuration16 #416: Support tests with valgrind17 #418: Better Win CodeBlock/MinGW support18 #419: Backport build environment improvements from the main branch19 - Build of mip_test and lp_test precede the running of the tests20 - Also search for coin libs under ${COIN_ROOT_DIR}/lib/coin21 - Do not look for COIN_VOL libraries22 #382: Allow lgf file without Arc maps23 #417: Bug fix in CostScaling24 25 2010-10-21 Version 1.2.1 released26 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 UndirectedTags34 #368: Fix the usage of std::numeric_limits<>::min() in Network Simplex35 #372: Fix a critical bug in preflow36 37 2010-03-19 Version 1.2 released38 39 This is major feature release40 41 * New algorithms42 * Bellman-Ford algorithm (#51)43 * Minimum mean cycle algorithms (#179)44 * Karp, Hartman-Orlin and Howard algorithms45 * New minimum cost flow algorithms (#180)46 * Cost Scaling algorithms47 * Capacity Scaling algorithm48 * Cycle-Canceling algorithms49 * Planarity related algorithms (#62)50 * Planarity checking algorithm51 * Planar embedding algorithm52 * Schnyder's planar drawing algorithm53 * Coloring planar graphs with five or six colors54 * Fractional matching algorithms (#314)55 * New data structures56 * StaticDigraph structure (#68)57 * Several new priority queue structures (#50, #301)58 * Fibonacci, Radix, Bucket, Pairing, Binomial59 D-ary and fourary heaps (#301)60 * Iterable map structures (#73)61 * Other new tools and functionality62 * 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 NetworkSimplex69 to handle graph changes (#327)70 * tolerance() functions are added to HaoOrlin (#306)71 * Implementation improvements72 * Improvements in weighted matching algorithms (#314)73 * Jumpstart initialization74 * ArcIt iteration is based on out-arc lists instead of in-arc lists75 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 * Miscellaneous80 * A simple interactive bootstrap script81 * 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 tests85 * 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 pragmas89 ----: Various CMAKE related improvements90 * Remove duplications from doc/CMakeLists.txt91 * Rename documentation install folder from 'docs' to 'html'92 * Add tools/CMakeLists.txt to the tarball93 * Generate and install LEMONConfig.cmake94 * Change the label of the html project in Visual Studio95 * Fix the check for the 'long long' type96 * Put the version string into config.h97 * Minor CMake improvements98 * Set the version to 'hg-tip' if everything fails99 #311: Add missing 'explicit' keywords100 #302: Fix the implementation and doc of CrossRefMap101 #308: Remove duplicate list_graph.h entry from source list102 #307: Bugfix in Preflow and Circulation103 #305: Bugfix and extension in the rename script104 #312: Also check ReferenceMapTag in concept checks105 #250: Bugfix in pathSource() and pathTarget()106 #321: Use pathCopy(from,to) instead of copyPath(to,from)107 #322: Distribure LEMONConfig.cmake.in108 #330: Bug fix in map_extender.h109 #336: Fix the date field comment of graphToEps() output110 #323: Bug fix in Suurballe111 #335: Fix clear() function in ExtendFindEnum112 #337: Use void* as the LPX object pointer113 #317: Fix (and improve) error message in mip_test.cc114 Remove unnecessary OsiCbc dependency115 #356: Allow multiple executions of weighted matching algorithms (#356)116 117 1 2009-05-13 Version 1.1 released 118 2 … … 189 73 ----: Add missing unistd.h include to time_measure.h 190 74 #204: Compilation bug fixed in graph_to_eps.h with VS2005 191 #214,#215: windows.h should never be included by LEMONheaders75 #214,#215: windows.h should never be included by lemon headers 192 76 #230: Build systems check the availability of 'long long' type 193 77 #229: Default implementation of Tolerance<> is used for integer types … … 211 95 2008-10-13 Version 1.0 released 212 96 213 214 215 216 97 This is the first stable release of LEMON. Compared to the 0.x 98 release series, it features a considerably smaller but more 99 matured set of tools. The API has also completely revised and 100 changed in several places. 217 101 218 102 * The major name changes compared to the 0.x series (see the 219 103 Migration Guide in the doc for more details) 220 104 * Graph -> Digraph, UGraph -> Graph 221 105 * Edge -> Arc, UEdge -> Edge 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 106 * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge) 107 * Other improvements 108 * Better documentation 109 * Reviewed and cleaned up codebase 110 * CMake based build system (along with the autotools based one) 111 * Contents of the library (ported from 0.x) 112 * Algorithms 113 * breadth-first search (bfs.h) 114 * depth-first search (dfs.h) 115 * Dijkstra's algorithm (dijkstra.h) 116 * Kruskal's algorithm (kruskal.h) 117 * Data structures 118 * graph data structures (list_graph.h, smart_graph.h) 119 * path data structures (path.h) 120 * binary heap data structure (bin_heap.h) 121 * union-find data structures (unionfind.h) 122 * miscellaneous property maps (maps.h) 123 * two dimensional vector and bounding box (dim2.h) 240 124 * Concepts 241 125 * graph structure concepts (concepts/digraph.h, concepts/graph.h, 242 126 concepts/graph_components.h) 243 244 245 246 247 248 249 250 251 127 * concepts for other structures (concepts/heap.h, concepts/maps.h, 128 concepts/path.h) 129 * Tools 130 * Mersenne twister random number generator (random.h) 131 * tools for measuring cpu and wall clock time (time_measure.h) 132 * tools for counting steps and events (counter.h) 133 * tool for parsing command line arguments (arg_parser.h) 134 * tool for visualizing graphs (graph_to_eps.h) 135 * tools for reading and writing data in LEMON Graph Format 252 136 (lgf_reader.h, lgf_writer.h) 253 137 * tools to handle the anomalies of calculations with 254 138 floating point numbers (tolerance.h) 255 139 * tools to manage RGB colors (color.h) 256 257 258 259 260 140 * Infrastructure 141 * extended assertion handling (assert.h) 142 * exception classes and error handling (error.h) 143 * concept checking (concept_check.h) 144 * commonly used mathematical constants (math.h)
Note: See TracChangeset
for help on using the changeset viewer.
