1 2010-03-08 Version 1.1.2 released
5 #317: Fix (and improve) error message in mip_test.cc
6 Remove unnecessary OsiCbc dependency
7 #250: Fix in pathSource() and pathTarget()
8 #322: Distribute LEMONConfig.cmake.in
9 #321: Use pathCopy(from,to) instead of copyPath(to,from)
10 #330: Bug fix in map_extender.h
11 #335: Fix clear() function in ExtendFindEnum
12 #337: Use void* as LPX object pointer
13 #336: Fix the date field comment of graphToEps() output
14 #323: Bug fix in Suurballe
16 2009-10-03 Version 1.1.1 released
20 #295: Suppress MSVC warnings using pragmas
21 ----: Various CMAKE related improvements
22 * Remove duplications from doc/CMakeLists.txt
23 * Rename documentation install folder from 'docs' to 'html'
24 * Add tools/CMakeLists.txt to the tarball
25 * Generate and install LEMONConfig.cmake
26 * Change the label of the html project in Visual Studio
27 * Fix the check for the 'long long' type
28 * Put the version string into config.h
29 * Minor CMake improvements
30 * Set the version to 'hg-tip' if everything fails
31 #311: Add missing 'explicit' keywords
32 #302: Fix the implementation and doc of CrossRefMap
33 #308: Remove duplicate list_graph.h entry from source list
34 #307: Bug fix in Preflow and Circulation
36 2009-05-13 Version 1.1 released
38 This is the second stable release of the 1.x series. It
39 features a better coverage of the tools available in the 0.x
40 series, a thoroughly reworked LP/MIP interface plus various
41 improvements in the existing tools.
43 * Much improved M$ Windows support
44 * Various improvements in the CMAKE build system
45 * Compilation warnings are fixed/suppressed
46 * Support IBM xlC compiler
48 * Connectivity related algorithms (#61)
50 * Preflow push-relabel max. flow algorithm (#176)
51 * Circulation algorithm (push-relabel based) (#175)
52 * Suurballe algorithm (#47)
53 * Gomory-Hu algorithm (#66)
54 * Hao-Orlin algorithm (#58)
55 * Edmond's maximum cardinality and weighted matching algorithms
56 in general graphs (#48,#265)
57 * Minimum cost arborescence/branching (#60)
58 * Network Simplex min. cost flow algorithm (#234)
60 * Full graph structure (#57)
61 * Grid graph structure (#57)
62 * Hypercube graph structure (#57)
63 * Graph adaptors (#67)
64 * ArcSet and EdgeSet classes (#67)
65 * Elevator class (#174)
67 * LP/MIP interface (#44)
68 * Support for GLPK, CPLEX, Soplex, COIN-OR CLP and CBC
69 * Reader for the Nauty file format (#55)
70 * DIMACS readers (#167)
71 * Radix sort algorithms (#72)
72 * RangeIdMap and CrossRefMap (#160)
73 * New command line tools
74 * DIMACS to LGF converter (#182)
75 * lgf-gen - a graph generator (#45)
76 * DIMACS solver utility (#226)
77 * Other code improvements
78 * Lognormal distribution added to Random (#102)
79 * Better (i.e. O(1) time) item counting in SmartGraph (#3)
80 * The standard maps of graphs are guaranteed to be
83 * Various doc improvements
84 * Improved 0.x -> 1.x converter script
86 * Several bugfixes (compared to release 1.0):
87 #170: Bugfix SmartDigraph::split()
88 #171: Bugfix in SmartGraph::restoreSnapshot()
89 #172: Extended test cases for graphs and digraphs
90 #173: Bugfix in Random
91 * operator()s always return a double now
92 * the faulty real<Num>(Num) and real<Num>(Num,Num)
94 #187: Remove DijkstraWidestPathOperationTraits
95 #61: Bugfix in DfsVisit
96 #193: Bugfix in GraphReader::skipSection()
97 #195: Bugfix in ConEdgeIt()
98 #197: Bugfix in heap unionfind
99 * This bug affects Edmond's general matching algorithms
100 #207: Fix 'make install' without 'make html' using CMAKE
101 #208: Suppress or fix VS2008 compilation warnings
102 ----: Update the LEMON icon
103 ----: Enable the component-based installer
104 (in installers made by CPACK)
105 ----: Set the proper version for CMAKE in the tarballs
107 ----: Minor clarification in the LICENSE file
108 ----: Add missing unistd.h include to time_measure.h
109 #204: Compilation bug fixed in graph_to_eps.h with VS2005
110 #214,#215: windows.h should never be included by lemon headers
111 #230: Build systems check the availability of 'long long' type
112 #229: Default implementation of Tolerance<> is used for integer types
113 #211,#212: Various fixes for compiling on AIX
114 ----: Improvements in CMAKE config
115 - docs is installed in share/doc/
116 - detects newer versions of Ghostscript
117 #239: Fix missing 'inline' specifier in time_measure.h
118 #274,#280: Install lemon/config.h
119 #275: Prefix macro names with LEMON_ in lemon/config.h
120 ----: Small script for making the release tarballs added
121 ----: Minor improvement in unify-sources.sh (a76f55d7d397)
123 2009-03-27 LEMON joins to the COIN-OR initiative
125 COIN-OR (Computational Infrastructure for Operations Research,
126 http://www.coin-or.org) project is an initiative to spur the
127 development of open-source software for the operations research
130 2008-10-13 Version 1.0 released
132 This is the first stable release of LEMON. Compared to the 0.x
133 release series, it features a considerably smaller but more
134 matured set of tools. The API has also completely revised and
135 changed in several places.
137 * The major name changes compared to the 0.x series (see the
138 Migration Guide in the doc for more details)
139 * Graph -> Digraph, UGraph -> Graph
140 * Edge -> Arc, UEdge -> Edge
141 * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge)
143 * Better documentation
144 * Reviewed and cleaned up codebase
145 * CMake based build system (along with the autotools based one)
146 * Contents of the library (ported from 0.x)
148 * breadth-first search (bfs.h)
149 * depth-first search (dfs.h)
150 * Dijkstra's algorithm (dijkstra.h)
151 * Kruskal's algorithm (kruskal.h)
153 * graph data structures (list_graph.h, smart_graph.h)
154 * path data structures (path.h)
155 * binary heap data structure (bin_heap.h)
156 * union-find data structures (unionfind.h)
157 * miscellaneous property maps (maps.h)
158 * two dimensional vector and bounding box (dim2.h)
160 * graph structure concepts (concepts/digraph.h, concepts/graph.h,
161 concepts/graph_components.h)
162 * concepts for other structures (concepts/heap.h, concepts/maps.h,
165 * Mersenne twister random number generator (random.h)
166 * tools for measuring cpu and wall clock time (time_measure.h)
167 * tools for counting steps and events (counter.h)
168 * tool for parsing command line arguments (arg_parser.h)
169 * tool for visualizing graphs (graph_to_eps.h)
170 * tools for reading and writing data in LEMON Graph Format
171 (lgf_reader.h, lgf_writer.h)
172 * tools to handle the anomalies of calculations with
173 floating point numbers (tolerance.h)
174 * tools to manage RGB colors (color.h)
176 * extended assertion handling (assert.h)
177 * exception classes and error handling (error.h)
178 * concept checking (concept_check.h)
179 * commonly used mathematical constants (math.h)