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