1 2009-03-27 LEMON joins to the COIN-OR initiative
3 COIN-OR (Computational Infrastructure for Operations Research,
4 http://www.coin-or.org) project is an initiative to spur the
5 development of open-source software for the operations research
8 2009-03-26 Version 1.0.3 released
10 Bugfix release, mainly targeting better AIX/xlC and WIN32
13 ----: Minor clarification in the LICENSE file
14 ----: Add missing unistd.h include to time_measure.h
15 #204: Compilation bug fixed in graph_to_eps.h with VS2005
16 #214,#215: windows.h is never be included by lemon headers
17 #230: Build systems check the availability of 'long long' type
18 #229: Default implementation of Tolerance<> is used for integer types
19 #211,#212: Various fixes for compiling on AIX
20 ----: Improvements in CMAKE config
21 - docs is installed in share/doc/
22 - detects newer versions of Ghostscript
23 #239: Fix missing 'inline' specifier in time_measure.h
25 2009-01-23 Version 1.0.2 released
29 #193: Bugfix in GraphReader::skipSection()
30 #195: Bugfix in ConEdgeIt()
31 #197: Bugfix in heap unionfind
32 * This bug affects Edmond's general matching algorithms.
33 (Not available in this release.)
34 #207: Fix 'make install' without 'make html' using CMAKE
35 #208: Suppress or fix VS2008 compilation warnings
36 ----: Update the LEMON icon
37 ----: Enable the component-based installer
38 (in installers made by CPACK)
39 ----: Set the proper version for CMAKE in the tarballs
42 2008-12-06 Version 1.0.1 released
46 #170: Bugfix SmartDigraph::split()
47 #171: Bugfix in SmartGraph::restoreSnapshot()
48 #172: Extended test cases for graphs and digraphs
49 #173: Bugfix in Random
50 * operator()s always return a double now
51 * the faulty real<Num>(Num) and real<Num>(Num,Num)
53 #187: Remove DijkstraWidestPathOperationTraits
54 #61: Bugfix in DfsVisit
56 2008-10-13 Version 1.0 released
58 This is the first stable release of LEMON. Compared to the 0.x
59 release series, it features a considerably smaller but more
60 matured set of tools. The API has also completely revised and
61 changed in several places.
63 * The major name changes compared to the 0.x series (see the
64 Migration Guide in the doc for more details)
65 * Graph -> Digraph, UGraph -> Graph
66 * Edge -> Arc, UEdge -> Edge
67 * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge)
69 * Better documentation
70 * Reviewed and cleaned up codebase
71 * CMake based build system (along with the autotools based one)
72 * Contents of the library (ported from 0.x)
74 * breadth-first search (bfs.h)
75 * depth-first search (dfs.h)
76 * Dijkstra's algorithm (dijkstra.h)
77 * Kruskal's algorithm (kruskal.h)
79 * graph data structures (list_graph.h, smart_graph.h)
80 * path data structures (path.h)
81 * binary heap data structure (bin_heap.h)
82 * union-find data structures (unionfind.h)
83 * miscellaneous property maps (maps.h)
84 * two dimensional vector and bounding box (dim2.h)
86 * graph structure concepts (concepts/digraph.h, concepts/graph.h,
87 concepts/graph_components.h)
88 * concepts for other structures (concepts/heap.h, concepts/maps.h,
91 * Mersenne twister random number generator (random.h)
92 * tools for measuring cpu and wall clock time (time_measure.h)
93 * tools for counting steps and events (counter.h)
94 * tool for parsing command line arguments (arg_parser.h)
95 * tool for visualizing graphs (graph_to_eps.h)
96 * tools for reading and writing data in LEMON Graph Format
97 (lgf_reader.h, lgf_writer.h)
98 * tools to handle the anomalies of calculations with
99 floating point numbers (tolerance.h)
100 * tools to manage RGB colors (color.h)
102 * extended assertion handling (assert.h)
103 * exception classes and error handling (error.h)
104 * concept checking (concept_check.h)
105 * commonly used mathematical constants (math.h)