NEWS
author Balazs Dezso <deba@inf.elte.hu>
Wed, 01 Apr 2009 22:54:00 +0200
changeset 565 7ab97e2a0c33
parent 322 6dbd5184c6a9
child 665 e652b6f9a29f
permissions -rw-r--r--
Fixing presolver and basis handling (#255)
alpar@507
     1
2009-03-27 LEMON joins to the COIN-OR initiative
alpar@507
     2
alpar@507
     3
        COIN-OR (Computational Infrastructure for Operations Research,
alpar@507
     4
        http://www.coin-or.org) project is an initiative to spur the
alpar@507
     5
        development of open-source software for the operations research
alpar@507
     6
        community.
alpar@507
     7
alpar@322
     8
2008-10-13 Version 1.0 released
alpar@262
     9
alpar@262
    10
	This is the first stable release of LEMON. Compared to the 0.x
alpar@262
    11
	release series, it features a considerably smaller but more
alpar@262
    12
	matured set of tools. The API has also completely revised and
alpar@262
    13
	changed in several places.
alpar@262
    14
alpar@322
    15
	* The major name changes compared to the 0.x series (see the
alpar@322
    16
          Migration Guide in the doc for more details)
alpar@262
    17
          * Graph -> Digraph, UGraph -> Graph
alpar@262
    18
          * Edge -> Arc, UEdge -> Edge
alpar@262
    19
	  * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge)
alpar@262
    20
	* Other improvements
alpar@262
    21
	  * Better documentation
alpar@262
    22
	  * Reviewed and cleaned up codebase
alpar@262
    23
	  * CMake based build system (along with the autotools based one)
alpar@262
    24
	* Contents of the library (ported from 0.x)
alpar@262
    25
	  * Algorithms
alpar@262
    26
       	    * breadth-first search (bfs.h)
alpar@262
    27
       	    * depth-first search (dfs.h)
alpar@262
    28
       	    * Dijkstra's algorithm (dijkstra.h)
alpar@262
    29
       	    * Kruskal's algorithm (kruskal.h)
alpar@262
    30
    	  * Data structures
alpar@262
    31
       	    * graph data structures (list_graph.h, smart_graph.h)
alpar@262
    32
       	    * path data structures (path.h)
alpar@262
    33
       	    * binary heap data structure (bin_heap.h)
alpar@262
    34
       	    * union-find data structures (unionfind.h)
alpar@262
    35
       	    * miscellaneous property maps (maps.h)
alpar@262
    36
       	    * two dimensional vector and bounding box (dim2.h)
alpar@262
    37
          * Concepts
alpar@262
    38
       	    * graph structure concepts (concepts/digraph.h, concepts/graph.h,
alpar@262
    39
              concepts/graph_components.h)
alpar@262
    40
       	    * concepts for other structures (concepts/heap.h, concepts/maps.h,
alpar@262
    41
	      concepts/path.h)
alpar@262
    42
    	  * Tools
alpar@262
    43
       	    * Mersenne twister random number generator (random.h)
alpar@262
    44
       	    * tools for measuring cpu and wall clock time (time_measure.h)
alpar@262
    45
       	    * tools for counting steps and events (counter.h)
alpar@262
    46
       	    * tool for parsing command line arguments (arg_parser.h)
alpar@262
    47
       	    * tool for visualizing graphs (graph_to_eps.h)
alpar@262
    48
       	    * tools for reading and writing data in LEMON Graph Format
alpar@262
    49
              (lgf_reader.h, lgf_writer.h)
alpar@262
    50
            * tools to handle the anomalies of calculations with
alpar@262
    51
	      floating point numbers (tolerance.h)
alpar@262
    52
            * tools to manage RGB colors (color.h)
alpar@262
    53
    	  * Infrastructure
alpar@262
    54
       	    * extended assertion handling (assert.h)
alpar@262
    55
       	    * exception classes and error handling (error.h)
alpar@262
    56
      	    * concept checking (concept_check.h)
alpar@262
    57
       	    * commonly used mathematical constants (math.h)