COIN-OR::LEMON - Graph Library

source: lemon/NEWS @ 1248:14394c9603c2

1.1
Last change on this file since 1248:14394c9603c2 was 1096:bcb6e4402a6e, checked in by Alpar Juttner <alpar@…>, 12 years ago

Update NEWS file

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