Changes in NEWS [881:87569cb5734d:665:e652b6f9a29f] in lemon-main
Legend:
- Unmodified
- Added
- Removed
-
NEWS
r881 r665 1 2010-03-19 Version 1.2 released2 3 This is major feature release4 5 * New algorithms6 * Bellman-Ford algorithm (#51)7 * Minimum mean cycle algorithms (#179)8 * Karp, Hartman-Orlin and Howard algorithms9 * New minimum cost flow algorithms (#180)10 * Cost Scaling algorithms11 * Capacity Scaling algorithm12 * Cycle-Canceling algorithms13 * Planarity related algorithms (#62)14 * Planarity checking algorithm15 * Planar embedding algorithm16 * Schnyder's planar drawing algorithm17 * Coloring planar graphs with five or six colors18 * Fractional matching algorithms (#314)19 * New data structures20 * StaticDigraph structure (#68)21 * Several new priority queue structures (#50, #301)22 * Fibonacci, Radix, Bucket, Pairing, Binomial23 D-ary and fourary heaps (#301)24 * Iterable map structures (#73)25 * Other new tools and functionality26 * Map utility functions (#320)27 * Reserve functions are added to ListGraph and SmartGraph (#311)28 * A resize() function is added to HypercubeGraph (#311)29 * A count() function is added to CrossRefMap (#302)30 * Support for multiple targets in Suurballe using fullInit() (#181)31 * Traits class and named parameters for Suurballe (#323)32 * Separate reset() and resetParams() functions in NetworkSimplex33 to handle graph changes (#327)34 * tolerance() functions are added to HaoOrlin (#306)35 * Implementation improvements36 * Improvements in weighted matching algorithms (#314)37 * Jumpstart initialization38 * ArcIt iteration is based on out-arc lists instead of in-arc lists39 in ListDigraph (#311)40 * Faster add row operation in CbcMip (#203)41 * Better implementation for split() in ListDigraph (#311)42 * ArgParser can also throw exception instead of exit(1) (#332)43 * Miscellaneous44 * A simple interactive bootstrap script45 * Doc improvements (#62,#180,#299,#302,#303,#304,#307,#311,#331,#315,46 #316,#319)47 * BibTeX references in the doc (#184)48 * Optionally use valgrind when running tests49 * Also check ReferenceMapTag in concept checks (#312)50 * dimacs-solver uses long long type by default.51 * Several bugfixes (compared to release 1.1):52 #295: Suppress MSVC warnings using pragmas53 ----: Various CMAKE related improvements54 * Remove duplications from doc/CMakeLists.txt55 * Rename documentation install folder from 'docs' to 'html'56 * Add tools/CMakeLists.txt to the tarball57 * Generate and install LEMONConfig.cmake58 * Change the label of the html project in Visual Studio59 * Fix the check for the 'long long' type60 * Put the version string into config.h61 * Minor CMake improvements62 * Set the version to 'hg-tip' if everything fails63 #311: Add missing 'explicit' keywords64 #302: Fix the implementation and doc of CrossRefMap65 #308: Remove duplicate list_graph.h entry from source list66 #307: Bugfix in Preflow and Circulation67 #305: Bugfix and extension in the rename script68 #312: Also check ReferenceMapTag in concept checks69 #250: Bugfix in pathSource() and pathTarget()70 #321: Use pathCopy(from,to) instead of copyPath(to,from)71 #322: Distribure LEMONConfig.cmake.in72 #330: Bug fix in map_extender.h73 #336: Fix the date field comment of graphToEps() output74 #323: Bug fix in Suurballe75 #335: Fix clear() function in ExtendFindEnum76 #337: Use void* as the LPX object pointer77 #317: Fix (and improve) error message in mip_test.cc78 Remove unnecessary OsiCbc dependency79 #356: Allow multiple executions of weighted matching algorithms (#356)80 81 1 2009-05-13 Version 1.1 released 82 2 … … 153 73 ----: Add missing unistd.h include to time_measure.h 154 74 #204: Compilation bug fixed in graph_to_eps.h with VS2005 155 #214,#215: windows.h should never be included by LEMONheaders75 #214,#215: windows.h should never be included by lemon headers 156 76 #230: Build systems check the availability of 'long long' type 157 77 #229: Default implementation of Tolerance<> is used for integer types … … 175 95 2008-10-13 Version 1.0 released 176 96 177 178 179 180 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. 181 101 182 102 * The major name changes compared to the 0.x series (see the 183 103 Migration Guide in the doc for more details) 184 104 * Graph -> Digraph, UGraph -> Graph 185 105 * Edge -> Arc, UEdge -> Edge 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 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) 204 124 * Concepts 205 125 * graph structure concepts (concepts/digraph.h, concepts/graph.h, 206 126 concepts/graph_components.h) 207 208 209 210 211 212 213 214 215 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 216 136 (lgf_reader.h, lgf_writer.h) 217 137 * tools to handle the anomalies of calculations with 218 138 floating point numbers (tolerance.h) 219 139 * tools to manage RGB colors (color.h) 220 221 222 223 224 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.