|
alpar@440
|
1 |
2008-12-06 Version 1.0.1 released
|
|
alpar@440
|
2 |
|
|
alpar@440
|
3 |
Bugfix release.
|
|
alpar@440
|
4 |
|
|
alpar@440
|
5 |
#170: Bugfix SmartDigraph::split()
|
|
alpar@440
|
6 |
#171: Bugfix in SmartGraph::restoreSnapshot()
|
|
alpar@440
|
7 |
#172: Extended test cases for graphs and digraphs
|
|
alpar@440
|
8 |
#173: Bugfix in Random
|
|
alpar@440
|
9 |
* operator()s always return a double now
|
|
alpar@440
|
10 |
* the faulty real<Num>(Num) and real<Num>(Num,Num)
|
|
alpar@440
|
11 |
have been removed
|
|
alpar@440
|
12 |
#187: Remove DijkstraWidestPathOperationTraits
|
|
alpar@440
|
13 |
#61: Bugfix in DfsVisit
|
|
alpar@440
|
14 |
|
|
alpar@322
|
15 |
2008-10-13 Version 1.0 released
|
|
alpar@262
|
16 |
|
|
alpar@262
|
17 |
This is the first stable release of LEMON. Compared to the 0.x
|
|
alpar@262
|
18 |
release series, it features a considerably smaller but more
|
|
alpar@262
|
19 |
matured set of tools. The API has also completely revised and
|
|
alpar@262
|
20 |
changed in several places.
|
|
alpar@262
|
21 |
|
|
alpar@322
|
22 |
* The major name changes compared to the 0.x series (see the
|
|
alpar@322
|
23 |
Migration Guide in the doc for more details)
|
|
alpar@262
|
24 |
* Graph -> Digraph, UGraph -> Graph
|
|
alpar@262
|
25 |
* Edge -> Arc, UEdge -> Edge
|
|
alpar@262
|
26 |
* source(UEdge)/target(UEdge) -> u(Edge)/v(Edge)
|
|
alpar@262
|
27 |
* Other improvements
|
|
alpar@262
|
28 |
* Better documentation
|
|
alpar@262
|
29 |
* Reviewed and cleaned up codebase
|
|
alpar@262
|
30 |
* CMake based build system (along with the autotools based one)
|
|
alpar@262
|
31 |
* Contents of the library (ported from 0.x)
|
|
alpar@262
|
32 |
* Algorithms
|
|
alpar@262
|
33 |
* breadth-first search (bfs.h)
|
|
alpar@262
|
34 |
* depth-first search (dfs.h)
|
|
alpar@262
|
35 |
* Dijkstra's algorithm (dijkstra.h)
|
|
alpar@262
|
36 |
* Kruskal's algorithm (kruskal.h)
|
|
alpar@262
|
37 |
* Data structures
|
|
alpar@262
|
38 |
* graph data structures (list_graph.h, smart_graph.h)
|
|
alpar@262
|
39 |
* path data structures (path.h)
|
|
alpar@262
|
40 |
* binary heap data structure (bin_heap.h)
|
|
alpar@262
|
41 |
* union-find data structures (unionfind.h)
|
|
alpar@262
|
42 |
* miscellaneous property maps (maps.h)
|
|
alpar@262
|
43 |
* two dimensional vector and bounding box (dim2.h)
|
|
alpar@262
|
44 |
* Concepts
|
|
alpar@262
|
45 |
* graph structure concepts (concepts/digraph.h, concepts/graph.h,
|
|
alpar@262
|
46 |
concepts/graph_components.h)
|
|
alpar@262
|
47 |
* concepts for other structures (concepts/heap.h, concepts/maps.h,
|
|
alpar@262
|
48 |
concepts/path.h)
|
|
alpar@262
|
49 |
* Tools
|
|
alpar@262
|
50 |
* Mersenne twister random number generator (random.h)
|
|
alpar@262
|
51 |
* tools for measuring cpu and wall clock time (time_measure.h)
|
|
alpar@262
|
52 |
* tools for counting steps and events (counter.h)
|
|
alpar@262
|
53 |
* tool for parsing command line arguments (arg_parser.h)
|
|
alpar@262
|
54 |
* tool for visualizing graphs (graph_to_eps.h)
|
|
alpar@262
|
55 |
* tools for reading and writing data in LEMON Graph Format
|
|
alpar@262
|
56 |
(lgf_reader.h, lgf_writer.h)
|
|
alpar@262
|
57 |
* tools to handle the anomalies of calculations with
|
|
alpar@262
|
58 |
floating point numbers (tolerance.h)
|
|
alpar@262
|
59 |
* tools to manage RGB colors (color.h)
|
|
alpar@262
|
60 |
* Infrastructure
|
|
alpar@262
|
61 |
* extended assertion handling (assert.h)
|
|
alpar@262
|
62 |
* exception classes and error handling (error.h)
|
|
alpar@262
|
63 |
* concept checking (concept_check.h)
|
|
alpar@262
|
64 |
* commonly used mathematical constants (math.h)
|