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