r440:d5f1163b1522
Sat, 06 Dec 2008 01:00:00
[Not Reviewed]
0 comments (0 inline)
0
1
0
14
| 1 |
2008-12-06 Version 1.0.1 released |
|
| 2 |
|
|
| 3 |
Bugfix release. |
|
| 4 |
|
|
| 5 |
#170: Bugfix SmartDigraph::split() |
|
| 6 |
#171: Bugfix in SmartGraph::restoreSnapshot() |
|
| 7 |
#172: Extended test cases for graphs and digraphs |
|
| 8 |
#173: Bugfix in Random |
|
| 9 |
* operator()s always return a double now |
|
| 10 |
* the faulty real<Num>(Num) and real<Num>(Num,Num) |
|
| 11 |
have been removed |
|
| 12 |
#187: Remove DijkstraWidestPathOperationTraits |
|
| 13 |
#61: Bugfix in DfsVisit |
|
| 14 |
|
|
| 1 | 15 |
2008-10-13 Version 1.0 released |
| 2 | 16 |
|
| 3 | 17 |
This is the first stable release of LEMON. Compared to the 0.x |
| 4 | 18 |
release series, it features a considerably smaller but more |
| 5 | 19 |
matured set of tools. The API has also completely revised and |
| 6 | 20 |
changed in several places. |
| 7 | 21 |
|
| 8 | 22 |
* The major name changes compared to the 0.x series (see the |
| 9 | 23 |
Migration Guide in the doc for more details) |
| 10 | 24 |
* Graph -> Digraph, UGraph -> Graph |
| 11 | 25 |
* Edge -> Arc, UEdge -> Edge |
| 12 | 26 |
* source(UEdge)/target(UEdge) -> u(Edge)/v(Edge) |
| 13 | 27 |
* Other improvements |
| 14 | 28 |
* Better documentation |
| 15 | 29 |
* Reviewed and cleaned up codebase |
| 16 | 30 |
* CMake based build system (along with the autotools based one) |
| 17 | 31 |
* Contents of the library (ported from 0.x) |
| 18 | 32 |
* Algorithms |
| 19 | 33 |
* breadth-first search (bfs.h) |
| 20 | 34 |
* depth-first search (dfs.h) |
| 21 | 35 |
* Dijkstra's algorithm (dijkstra.h) |
| 22 | 36 |
* Kruskal's algorithm (kruskal.h) |
| 23 | 37 |
* Data structures |
| 24 | 38 |
* graph data structures (list_graph.h, smart_graph.h) |
0 comments (0 inline)