COIN-OR::LEMON - Graph Library

source: lemon/NEWS @ 1003:dfdb58f52f02

1.1 r1.1.3
Last change on this file since 1003:dfdb58f52f02 was 1003:dfdb58f52f02, checked in by Alpar Juttner <alpar@…>, 7 years ago

Update NEWS file

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