COIN-OR::LEMON - Graph Library

source: lemon/NEWS @ 1081:f1398882a928

1.1 r1.1.4
Last change on this file since 1081:f1398882a928 was 1080:f22bc76370b2, checked in by Alpar Juttner <alpar@…>, 6 years ago

Update NEWS file

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