COIN-OR::LEMON - Graph Library

source: lemon/NEWS @ 440:d5f1163b1522

1.0 r1.0.1
Last change on this file since 440:d5f1163b1522 was 440:d5f1163b1522, checked in by Alpar Juttner <alpar@…>, 9 years ago

Update NEWS

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