r505:b4c892aa217c
Fri, 23 Jan 2009 19:11:58
[Not Reviewed]
0 comments (0 inline)
0
1
0
17
| 1 |
2009-01-23 Version 1.0.2 released |
|
| 2 |
|
|
| 3 |
Bugfix release. |
|
| 4 |
|
|
| 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 |
|
| 16 |
(made by autotools). |
|
| 17 |
|
|
| 1 | 18 |
2008-12-06 Version 1.0.1 released |
| 2 | 19 |
|
| 3 | 20 |
Bugfix release. |
| 4 | 21 |
|
| 5 | 22 |
#170: Bugfix SmartDigraph::split() |
| 6 | 23 |
#171: Bugfix in SmartGraph::restoreSnapshot() |
| 7 | 24 |
#172: Extended test cases for graphs and digraphs |
| 8 | 25 |
#173: Bugfix in Random |
| 9 | 26 |
* operator()s always return a double now |
| 10 | 27 |
* the faulty real<Num>(Num) and real<Num>(Num,Num) |
| 11 | 28 |
have been removed |
| 12 | 29 |
#187: Remove DijkstraWidestPathOperationTraits |
| 13 | 30 |
#61: Bugfix in DfsVisit |
| 14 | 31 |
|
| 15 | 32 |
2008-10-13 Version 1.0 released |
| 16 | 33 |
|
| 17 | 34 |
This is the first stable release of LEMON. Compared to the 0.x |
| 18 | 35 |
release series, it features a considerably smaller but more |
| 19 | 36 |
matured set of tools. The API has also completely revised and |
| 20 | 37 |
changed in several places. |
| 21 | 38 |
|
| 22 | 39 |
* The major name changes compared to the 0.x series (see the |
| 23 | 40 |
Migration Guide in the doc for more details) |
| 24 | 41 |
* Graph -> Digraph, UGraph -> Graph |
| 25 | 42 |
* Edge -> Arc, UEdge -> Edge |
| 26 | 43 |
* source(UEdge)/target(UEdge) -> u(Edge)/v(Edge) |
| 27 | 44 |
* Other improvements |
| 28 | 45 |
* Better documentation |
| 29 | 46 |
* Reviewed and cleaned up codebase |
| 30 | 47 |
* CMake based build system (along with the autotools based one) |
| 31 | 48 |
* Contents of the library (ported from 0.x) |
| 32 | 49 |
* Algorithms |
| 33 | 50 |
* breadth-first search (bfs.h) |
| 34 | 51 |
* depth-first search (dfs.h) |
| 35 | 52 |
* Dijkstra's algorithm (dijkstra.h) |
| 36 | 53 |
* Kruskal's algorithm (kruskal.h) |
| 37 | 54 |
* Data structures |
| 38 | 55 |
* graph data structures (list_graph.h, smart_graph.h) |
| 39 | 56 |
* path data structures (path.h) |
| 40 | 57 |
* binary heap data structure (bin_heap.h) |
| 41 | 58 |
* union-find data structures (unionfind.h) |
| 42 | 59 |
* miscellaneous property maps (maps.h) |
| 43 | 60 |
* two dimensional vector and bounding box (dim2.h) |
| 44 | 61 |
* Concepts |
| 45 | 62 |
* graph structure concepts (concepts/digraph.h, concepts/graph.h, |
| 46 | 63 |
concepts/graph_components.h) |
| 47 | 64 |
* concepts for other structures (concepts/heap.h, concepts/maps.h, |
| 48 | 65 |
concepts/path.h) |
0 comments (0 inline)