r322:6dbd5184c6a9
Sun, 12 Oct 2008 20:35:48
[Not Reviewed]
0 comments (0 inline)
0
1
0
3
2
| 1 |
|
|
| 1 |
2008-10-13 Version 1.0 released |
|
| 2 | 2 |
|
| 3 | 3 |
This is the first stable release of LEMON. Compared to the 0.x |
| 4 | 4 |
release series, it features a considerably smaller but more |
| 5 | 5 |
matured set of tools. The API has also completely revised and |
| 6 | 6 |
changed in several places. |
| 7 | 7 |
|
| 8 |
* The major name changes compared to the 0.x series |
|
| 8 |
* The major name changes compared to the 0.x series (see the |
|
| 9 |
Migration Guide in the doc for more details) |
|
| 9 | 10 |
* Graph -> Digraph, UGraph -> Graph |
| 10 | 11 |
* Edge -> Arc, UEdge -> Edge |
| 11 | 12 |
* source(UEdge)/target(UEdge) -> u(Edge)/v(Edge) |
| 12 | 13 |
* Other improvements |
| 13 | 14 |
* Better documentation |
| 14 | 15 |
* Reviewed and cleaned up codebase |
| 15 | 16 |
* CMake based build system (along with the autotools based one) |
| 16 | 17 |
* Contents of the library (ported from 0.x) |
| 17 | 18 |
* Algorithms |
| 18 | 19 |
* breadth-first search (bfs.h) |
| 19 | 20 |
* depth-first search (dfs.h) |
| 20 | 21 |
* Dijkstra's algorithm (dijkstra.h) |
| 21 | 22 |
* Kruskal's algorithm (kruskal.h) |
| 22 | 23 |
* Data structures |
| 23 | 24 |
* graph data structures (list_graph.h, smart_graph.h) |
| 24 | 25 |
* path data structures (path.h) |
| 25 | 26 |
* binary heap data structure (bin_heap.h) |
| 26 | 27 |
* union-find data structures (unionfind.h) |
| 27 | 28 |
* miscellaneous property maps (maps.h) |
| 28 | 29 |
* two dimensional vector and bounding box (dim2.h) |
| 29 | 30 |
* Concepts |
| 30 | 31 |
* graph structure concepts (concepts/digraph.h, concepts/graph.h, |
| 31 | 32 |
concepts/graph_components.h) |
| 32 | 33 |
* concepts for other structures (concepts/heap.h, concepts/maps.h, |
0 comments (0 inline)