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