Changes in NEWS [712:e652b6f9a29f:1005:ffc2d2559fc9] in lemon
Legend:
- Unmodified
- Added
- Removed
-
NEWS
r712 r1005 1 2010-10-21 Version 1.2.1 released 2 3 Bugfix release. 4 5 #366: Fix Pred[Matrix]MapPath::empty() 6 #371: Bug fix in (di)graphCopy() 7 The target graph is cleared before adding nodes and arcs/edges. 8 9 #364: Add missing UndirectedTags 10 #368: Fix the usage of std::numeric_limits<>::min() in Network Simplex 11 #372: Fix a critical bug in preflow 12 13 2010-03-19 Version 1.2 released 14 15 This is major feature release 16 17 * New algorithms 18 * Bellman-Ford algorithm (#51) 19 * Minimum mean cycle algorithms (#179) 20 * Karp, Hartman-Orlin and Howard algorithms 21 * New minimum cost flow algorithms (#180) 22 * Cost Scaling algorithms 23 * Capacity Scaling algorithm 24 * Cycle-Canceling algorithms 25 * Planarity related algorithms (#62) 26 * Planarity checking algorithm 27 * Planar embedding algorithm 28 * Schnyder's planar drawing algorithm 29 * Coloring planar graphs with five or six colors 30 * Fractional matching algorithms (#314) 31 * New data structures 32 * StaticDigraph structure (#68) 33 * Several new priority queue structures (#50, #301) 34 * Fibonacci, Radix, Bucket, Pairing, Binomial 35 D-ary and fourary heaps (#301) 36 * Iterable map structures (#73) 37 * Other new tools and functionality 38 * Map utility functions (#320) 39 * Reserve functions are added to ListGraph and SmartGraph (#311) 40 * A resize() function is added to HypercubeGraph (#311) 41 * A count() function is added to CrossRefMap (#302) 42 * Support for multiple targets in Suurballe using fullInit() (#181) 43 * Traits class and named parameters for Suurballe (#323) 44 * Separate reset() and resetParams() functions in NetworkSimplex 45 to handle graph changes (#327) 46 * tolerance() functions are added to HaoOrlin (#306) 47 * Implementation improvements 48 * Improvements in weighted matching algorithms (#314) 49 * Jumpstart initialization 50 * ArcIt iteration is based on out-arc lists instead of in-arc lists 51 in ListDigraph (#311) 52 * Faster add row operation in CbcMip (#203) 53 * Better implementation for split() in ListDigraph (#311) 54 * ArgParser can also throw exception instead of exit(1) (#332) 55 * Miscellaneous 56 * A simple interactive bootstrap script 57 * Doc improvements (#62,#180,#299,#302,#303,#304,#307,#311,#331,#315, 58 #316,#319) 59 * BibTeX references in the doc (#184) 60 * Optionally use valgrind when running tests 61 * Also check ReferenceMapTag in concept checks (#312) 62 * dimacs-solver uses long long type by default. 63 * Several bugfixes (compared to release 1.1): 64 #295: Suppress MSVC warnings using pragmas 65 ----: Various CMAKE related improvements 66 * Remove duplications from doc/CMakeLists.txt 67 * Rename documentation install folder from 'docs' to 'html' 68 * Add tools/CMakeLists.txt to the tarball 69 * Generate and install LEMONConfig.cmake 70 * Change the label of the html project in Visual Studio 71 * Fix the check for the 'long long' type 72 * Put the version string into config.h 73 * Minor CMake improvements 74 * Set the version to 'hg-tip' if everything fails 75 #311: Add missing 'explicit' keywords 76 #302: Fix the implementation and doc of CrossRefMap 77 #308: Remove duplicate list_graph.h entry from source list 78 #307: Bugfix in Preflow and Circulation 79 #305: Bugfix and extension in the rename script 80 #312: Also check ReferenceMapTag in concept checks 81 #250: Bugfix in pathSource() and pathTarget() 82 #321: Use pathCopy(from,to) instead of copyPath(to,from) 83 #322: Distribure LEMONConfig.cmake.in 84 #330: Bug fix in map_extender.h 85 #336: Fix the date field comment of graphToEps() output 86 #323: Bug fix in Suurballe 87 #335: Fix clear() function in ExtendFindEnum 88 #337: Use void* as the LPX object pointer 89 #317: Fix (and improve) error message in mip_test.cc 90 Remove unnecessary OsiCbc dependency 91 #356: Allow multiple executions of weighted matching algorithms (#356) 92 1 93 2009-05-13 Version 1.1 released 2 94 … … 73 165 ----: Add missing unistd.h include to time_measure.h 74 166 #204: Compilation bug fixed in graph_to_eps.h with VS2005 75 #214,#215: windows.h should never be included by lemonheaders167 #214,#215: windows.h should never be included by LEMON headers 76 168 #230: Build systems check the availability of 'long long' type 77 169 #229: Default implementation of Tolerance<> is used for integer types … … 95 187 2008-10-13 Version 1.0 released 96 188 97 98 99 100 101 102 189 This is the first stable release of LEMON. Compared to the 0.x 190 release series, it features a considerably smaller but more 191 matured set of tools. The API has also completely revised and 192 changed in several places. 193 194 * The major name changes compared to the 0.x series (see the 103 195 Migration Guide in the doc for more details) 104 196 * Graph -> Digraph, UGraph -> Graph 105 197 * Edge -> Arc, UEdge -> Edge 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 198 * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge) 199 * Other improvements 200 * Better documentation 201 * Reviewed and cleaned up codebase 202 * CMake based build system (along with the autotools based one) 203 * Contents of the library (ported from 0.x) 204 * Algorithms 205 * breadth-first search (bfs.h) 206 * depth-first search (dfs.h) 207 * Dijkstra's algorithm (dijkstra.h) 208 * Kruskal's algorithm (kruskal.h) 209 * Data structures 210 * graph data structures (list_graph.h, smart_graph.h) 211 * path data structures (path.h) 212 * binary heap data structure (bin_heap.h) 213 * union-find data structures (unionfind.h) 214 * miscellaneous property maps (maps.h) 215 * two dimensional vector and bounding box (dim2.h) 124 216 * Concepts 125 217 * graph structure concepts (concepts/digraph.h, concepts/graph.h, 126 218 concepts/graph_components.h) 127 128 129 130 131 132 133 134 135 219 * concepts for other structures (concepts/heap.h, concepts/maps.h, 220 concepts/path.h) 221 * Tools 222 * Mersenne twister random number generator (random.h) 223 * tools for measuring cpu and wall clock time (time_measure.h) 224 * tools for counting steps and events (counter.h) 225 * tool for parsing command line arguments (arg_parser.h) 226 * tool for visualizing graphs (graph_to_eps.h) 227 * tools for reading and writing data in LEMON Graph Format 136 228 (lgf_reader.h, lgf_writer.h) 137 229 * tools to handle the anomalies of calculations with 138 230 floating point numbers (tolerance.h) 139 231 * tools to manage RGB colors (color.h) 140 141 142 143 144 232 * Infrastructure 233 * extended assertion handling (assert.h) 234 * exception classes and error handling (error.h) 235 * concept checking (concept_check.h) 236 * commonly used mathematical constants (math.h)
Note: See TracChangeset
for help on using the changeset viewer.