Changes in NEWS [1005:ffc2d2559fc9:534:4f3ea453eb90] in lemon
Legend:
- Unmodified
- Added
- Removed
-
NEWS
r1005 r534 1 2010-10-21 Version 1.2.1 released2 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 UndirectedTags10 #368: Fix the usage of std::numeric_limits<>::min() in Network Simplex11 #372: Fix a critical bug in preflow12 13 2010-03-19 Version 1.2 released14 15 This is major feature release16 17 * New algorithms18 * Bellman-Ford algorithm (#51)19 * Minimum mean cycle algorithms (#179)20 * Karp, Hartman-Orlin and Howard algorithms21 * New minimum cost flow algorithms (#180)22 * Cost Scaling algorithms23 * Capacity Scaling algorithm24 * Cycle-Canceling algorithms25 * Planarity related algorithms (#62)26 * Planarity checking algorithm27 * Planar embedding algorithm28 * Schnyder's planar drawing algorithm29 * Coloring planar graphs with five or six colors30 * Fractional matching algorithms (#314)31 * New data structures32 * StaticDigraph structure (#68)33 * Several new priority queue structures (#50, #301)34 * Fibonacci, Radix, Bucket, Pairing, Binomial35 D-ary and fourary heaps (#301)36 * Iterable map structures (#73)37 * Other new tools and functionality38 * 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 NetworkSimplex45 to handle graph changes (#327)46 * tolerance() functions are added to HaoOrlin (#306)47 * Implementation improvements48 * Improvements in weighted matching algorithms (#314)49 * Jumpstart initialization50 * ArcIt iteration is based on out-arc lists instead of in-arc lists51 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 * Miscellaneous56 * A simple interactive bootstrap script57 * 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 tests61 * 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 pragmas65 ----: Various CMAKE related improvements66 * Remove duplications from doc/CMakeLists.txt67 * Rename documentation install folder from 'docs' to 'html'68 * Add tools/CMakeLists.txt to the tarball69 * Generate and install LEMONConfig.cmake70 * Change the label of the html project in Visual Studio71 * Fix the check for the 'long long' type72 * Put the version string into config.h73 * Minor CMake improvements74 * Set the version to 'hg-tip' if everything fails75 #311: Add missing 'explicit' keywords76 #302: Fix the implementation and doc of CrossRefMap77 #308: Remove duplicate list_graph.h entry from source list78 #307: Bugfix in Preflow and Circulation79 #305: Bugfix and extension in the rename script80 #312: Also check ReferenceMapTag in concept checks81 #250: Bugfix in pathSource() and pathTarget()82 #321: Use pathCopy(from,to) instead of copyPath(to,from)83 #322: Distribure LEMONConfig.cmake.in84 #330: Bug fix in map_extender.h85 #336: Fix the date field comment of graphToEps() output86 #323: Bug fix in Suurballe87 #335: Fix clear() function in ExtendFindEnum88 #337: Use void* as the LPX object pointer89 #317: Fix (and improve) error message in mip_test.cc90 Remove unnecessary OsiCbc dependency91 #356: Allow multiple executions of weighted matching algorithms (#356)92 93 2009-05-13 Version 1.1 released94 95 This is the second stable release of the 1.x series. It96 features a better coverage of the tools available in the 0.x97 series, a thoroughly reworked LP/MIP interface plus various98 improvements in the existing tools.99 100 * Much improved M$ Windows support101 * Various improvements in the CMAKE build system102 * Compilation warnings are fixed/suppressed103 * Support IBM xlC compiler104 * New algorithms105 * Connectivity related algorithms (#61)106 * Euler walks (#65)107 * Preflow push-relabel max. flow algorithm (#176)108 * Circulation algorithm (push-relabel based) (#175)109 * Suurballe algorithm (#47)110 * Gomory-Hu algorithm (#66)111 * Hao-Orlin algorithm (#58)112 * Edmond's maximum cardinality and weighted matching algorithms113 in general graphs (#48,#265)114 * Minimum cost arborescence/branching (#60)115 * Network Simplex min. cost flow algorithm (#234)116 * New data structures117 * Full graph structure (#57)118 * Grid graph structure (#57)119 * Hypercube graph structure (#57)120 * Graph adaptors (#67)121 * ArcSet and EdgeSet classes (#67)122 * Elevator class (#174)123 * Other new tools124 * LP/MIP interface (#44)125 * Support for GLPK, CPLEX, Soplex, COIN-OR CLP and CBC126 * Reader for the Nauty file format (#55)127 * DIMACS readers (#167)128 * Radix sort algorithms (#72)129 * RangeIdMap and CrossRefMap (#160)130 * New command line tools131 * DIMACS to LGF converter (#182)132 * lgf-gen - a graph generator (#45)133 * DIMACS solver utility (#226)134 * Other code improvements135 * Lognormal distribution added to Random (#102)136 * Better (i.e. O(1) time) item counting in SmartGraph (#3)137 * The standard maps of graphs are guaranteed to be138 reference maps (#190)139 * Miscellaneous140 * Various doc improvements141 * Improved 0.x -> 1.x converter script142 143 * Several bugfixes (compared to release 1.0):144 #170: Bugfix SmartDigraph::split()145 #171: Bugfix in SmartGraph::restoreSnapshot()146 #172: Extended test cases for graphs and digraphs147 #173: Bugfix in Random148 * operator()s always return a double now149 * the faulty real<Num>(Num) and real<Num>(Num,Num)150 have been removed151 #187: Remove DijkstraWidestPathOperationTraits152 #61: Bugfix in DfsVisit153 #193: Bugfix in GraphReader::skipSection()154 #195: Bugfix in ConEdgeIt()155 #197: Bugfix in heap unionfind156 * This bug affects Edmond's general matching algorithms157 #207: Fix 'make install' without 'make html' using CMAKE158 #208: Suppress or fix VS2008 compilation warnings159 ----: Update the LEMON icon160 ----: Enable the component-based installer161 (in installers made by CPACK)162 ----: Set the proper version for CMAKE in the tarballs163 (made by autotools)164 ----: Minor clarification in the LICENSE file165 ----: Add missing unistd.h include to time_measure.h166 #204: Compilation bug fixed in graph_to_eps.h with VS2005167 #214,#215: windows.h should never be included by LEMON headers168 #230: Build systems check the availability of 'long long' type169 #229: Default implementation of Tolerance<> is used for integer types170 #211,#212: Various fixes for compiling on AIX171 ----: Improvements in CMAKE config172 - docs is installed in share/doc/173 - detects newer versions of Ghostscript174 #239: Fix missing 'inline' specifier in time_measure.h175 #274,#280: Install lemon/config.h176 #275: Prefix macro names with LEMON_ in lemon/config.h177 ----: Small script for making the release tarballs added178 ----: Minor improvement in unify-sources.sh (a76f55d7d397)179 180 1 2009-03-27 LEMON joins to the COIN-OR initiative 181 2 … … 187 8 2008-10-13 Version 1.0 released 188 9 189 190 191 192 10 This is the first stable release of LEMON. Compared to the 0.x 11 release series, it features a considerably smaller but more 12 matured set of tools. The API has also completely revised and 13 changed in several places. 193 14 194 15 * The major name changes compared to the 0.x series (see the 195 16 Migration Guide in the doc for more details) 196 17 * Graph -> Digraph, UGraph -> Graph 197 18 * Edge -> Arc, UEdge -> Edge 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 19 * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge) 20 * Other improvements 21 * Better documentation 22 * Reviewed and cleaned up codebase 23 * CMake based build system (along with the autotools based one) 24 * Contents of the library (ported from 0.x) 25 * Algorithms 26 * breadth-first search (bfs.h) 27 * depth-first search (dfs.h) 28 * Dijkstra's algorithm (dijkstra.h) 29 * Kruskal's algorithm (kruskal.h) 30 * Data structures 31 * graph data structures (list_graph.h, smart_graph.h) 32 * path data structures (path.h) 33 * binary heap data structure (bin_heap.h) 34 * union-find data structures (unionfind.h) 35 * miscellaneous property maps (maps.h) 36 * two dimensional vector and bounding box (dim2.h) 216 37 * Concepts 217 38 * graph structure concepts (concepts/digraph.h, concepts/graph.h, 218 39 concepts/graph_components.h) 219 220 221 222 223 224 225 226 227 40 * concepts for other structures (concepts/heap.h, concepts/maps.h, 41 concepts/path.h) 42 * Tools 43 * Mersenne twister random number generator (random.h) 44 * tools for measuring cpu and wall clock time (time_measure.h) 45 * tools for counting steps and events (counter.h) 46 * tool for parsing command line arguments (arg_parser.h) 47 * tool for visualizing graphs (graph_to_eps.h) 48 * tools for reading and writing data in LEMON Graph Format 228 49 (lgf_reader.h, lgf_writer.h) 229 50 * tools to handle the anomalies of calculations with 230 51 floating point numbers (tolerance.h) 231 52 * tools to manage RGB colors (color.h) 232 233 234 235 236 53 * Infrastructure 54 * extended assertion handling (assert.h) 55 * exception classes and error handling (error.h) 56 * concept checking (concept_check.h) 57 * commonly used mathematical constants (math.h)
Note: See TracChangeset
for help on using the changeset viewer.
