| 1 |
2009-03-27 LEMON joins to the COIN-OR initiative |
|
| 2 |
|
|
| 3 |
COIN-OR (Computational Infrastructure for Operations Research, |
|
| 4 |
http://www.coin-or.org) project is an initiative to spur the |
|
| 5 |
development of open-source software for the operations research |
|
| 6 |
community. |
|
| 7 |
|
|
| 1 | 8 |
2008-10-13 Version 1.0 released |
| 2 | 9 |
|
| 3 | 10 |
This is the first stable release of LEMON. Compared to the 0.x |
| 4 | 11 |
release series, it features a considerably smaller but more |
| 5 | 12 |
matured set of tools. The API has also completely revised and |
| 6 | 13 |
changed in several places. |
| 7 | 14 |
|
| 8 | 15 |
* The major name changes compared to the 0.x series (see the |
| 9 | 16 |
Migration Guide in the doc for more details) |
| 10 | 17 |
* Graph -> Digraph, UGraph -> Graph |
| 11 | 18 |
* Edge -> Arc, UEdge -> Edge |
| 12 | 19 |
* source(UEdge)/target(UEdge) -> u(Edge)/v(Edge) |
| 13 | 20 |
* Other improvements |
| 14 | 21 |
* Better documentation |
| 15 | 22 |
* Reviewed and cleaned up codebase |
| 16 | 23 |
* CMake based build system (along with the autotools based one) |
| 17 | 24 |
* Contents of the library (ported from 0.x) |
| 18 | 25 |
* Algorithms |
| 19 | 26 |
* breadth-first search (bfs.h) |
| 20 | 27 |
* depth-first search (dfs.h) |
| 21 | 28 |
* Dijkstra's algorithm (dijkstra.h) |
| 22 | 29 |
* Kruskal's algorithm (kruskal.h) |
| 23 | 30 |
* Data structures |
| 24 | 31 |
* graph data structures (list_graph.h, smart_graph.h) |
0 comments (0 inline)