1 2009-01-23 Version 1.0.2 released
5 #193: Bugfix in GraphReader::skipSection()
6 #195: Bugfix in ConEdgeIt()
7 #197: Bugfix in heap unionfind
8 * This bug affects Edmond's general matching algorithms.
9 (Not available in this release.)
10 #207: Fix 'make install' without 'make html' using CMAKE
11 #208: Suppress or fix VS2008 compilation warnings
12 ----: Update the LEMON icon
13 ----: Enable the component-based installer
14 (in installers made by CPACK)
15 ----: Set the proper version for CMAKE in the tarballs
18 2008-12-06 Version 1.0.1 released
22 #170: Bugfix SmartDigraph::split()
23 #171: Bugfix in SmartGraph::restoreSnapshot()
24 #172: Extended test cases for graphs and digraphs
25 #173: Bugfix in Random
26 * operator()s always return a double now
27 * the faulty real<Num>(Num) and real<Num>(Num,Num)
29 #187: Remove DijkstraWidestPathOperationTraits
30 #61: Bugfix in DfsVisit
32 2008-10-13 Version 1.0 released
34 This is the first stable release of LEMON. Compared to the 0.x
35 release series, it features a considerably smaller but more
36 matured set of tools. The API has also completely revised and
37 changed in several places.
39 * The major name changes compared to the 0.x series (see the
40 Migration Guide in the doc for more details)
41 * Graph -> Digraph, UGraph -> Graph
42 * Edge -> Arc, UEdge -> Edge
43 * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge)
45 * Better documentation
46 * Reviewed and cleaned up codebase
47 * CMake based build system (along with the autotools based one)
48 * Contents of the library (ported from 0.x)
50 * breadth-first search (bfs.h)
51 * depth-first search (dfs.h)
52 * Dijkstra's algorithm (dijkstra.h)
53 * Kruskal's algorithm (kruskal.h)
55 * graph data structures (list_graph.h, smart_graph.h)
56 * path data structures (path.h)
57 * binary heap data structure (bin_heap.h)
58 * union-find data structures (unionfind.h)
59 * miscellaneous property maps (maps.h)
60 * two dimensional vector and bounding box (dim2.h)
62 * graph structure concepts (concepts/digraph.h, concepts/graph.h,
63 concepts/graph_components.h)
64 * concepts for other structures (concepts/heap.h, concepts/maps.h,
67 * Mersenne twister random number generator (random.h)
68 * tools for measuring cpu and wall clock time (time_measure.h)
69 * tools for counting steps and events (counter.h)
70 * tool for parsing command line arguments (arg_parser.h)
71 * tool for visualizing graphs (graph_to_eps.h)
72 * tools for reading and writing data in LEMON Graph Format
73 (lgf_reader.h, lgf_writer.h)
74 * tools to handle the anomalies of calculations with
75 floating point numbers (tolerance.h)
76 * tools to manage RGB colors (color.h)
78 * extended assertion handling (assert.h)
79 * exception classes and error handling (error.h)
80 * concept checking (concept_check.h)
81 * commonly used mathematical constants (math.h)