COIN-OR::LEMON - Graph Library

Ticket #341: 341-news-4dd5b7726a02.patch

File 341-news-4dd5b7726a02.patch, 9.2 KB (added by Peter Kovacs, 9 years ago)
  • NEWS

    # HG changeset patch
    # User Peter Kovacs <kpeter@inf.elte.hu>
    # Date 1265955935 -3600
    # Node ID 4dd5b7726a029a57b3ecdf3ab6cd0ed64f0ccd25
    # Parent  f903263902f6831f14205dab9f1d00cb5275e171
    Preliminary update of the NEWS file (#341)
    
    diff --git a/NEWS b/NEWS
    a b  
     12010-02-?? Version 1.2 released
     2
     3        This is the third stable release of the 1.x series.
     4
     5        * New algorithms
     6          * Bellman-Ford algorithm (#51)
     7          * Minimum mean cycle algorithms (#179)
     8            * Karp algorithm
     9            * Hartman-Orlin algorithm
     10            * Howard algorithm
     11          * New minimum cost flow algorithms (#180)
     12            * Cost Scaling algorithms
     13            * Capacity Scaling algorithm
     14            * Cycle-Canceling algorithms
     15          * Planarity related algorithms (#62)
     16            * Planarity checking algorithm
     17            * Planar embedding algorithm
     18            * Schnyder's planar drawing algorithm
     19            * Coloring planar graphs with five or six colors
     20          * Fractional matching algorithms (#314)
     21        * New data structures
     22          * StaticDigraph structure (#68)
     23          * New heap structures
     24            * Fibonacci heap (#50)
     25            * Radix heap (#50)
     26            * Bucket heaps (#50)
     27            * D-ary and fourary heaps (#301)
     28            * Pairing heap (#301)
     29            * Binomial heap (#301)
     30          * Iterable map structures (#73)
     31        * Other new tools
     32          * Map utility functions (#320)
     33        * Other code improvements
     34          * Much better implementation for split() in ListDigraph (#311)
     35          * ArcIt iteration is based on out-arc lists instead of in-arc lists
     36            in ListDigraph (#311)
     37          * Add reserve functions to ListGraph and SmartGraph (#311)
     38          * Add a resize() function to HypercubeGraph (#311)
     39          * Add a count() function to CrossRefMap (#302)
     40          * Faster add row operation in CbcMip (#203)
     41          * Support multiple targets in Suurballe using fullInit() (#181)
     42          * Add traits class and named parameters to Suurballe (#323)
     43          * Separate reset() and resetParams() functions in NetworkSimplex
     44            to handle graph changes (#327)
     45          * General improvements in weighted matching algorithms (#314)
     46          * Fractional matching initialization of weighted matchings (#314)
     47          * Improved tests for several tools (#302, #307, #293)
     48        * Miscellaneous
     49          * Add citations to the documentation (#184)
     50          * Add a BibTeX to Doxygen converter script (#184)
     51          * Add a simple interactive bootstrap script
     52          * Optionally use valgrind when running tests
     53          * Various doc improvements and extensions
     54
     55        * Several bugfixes (compared to release 1.1):
     56          #295: Suppress MSVC warnings using pragmas
     57          ----: Various CMAKE related improvements
     58                * Remove duplications from doc/CMakeLists.txt
     59                * Rename documentation install folder from 'docs' to 'html'
     60                * Add tools/CMakeLists.txt to the tarball
     61                * Generate and install LEMONConfig.cmake
     62                * Change the label of the html project in Visual Studio
     63                * Fix the check for the 'long long' type
     64                * Put the version string into config.h
     65                * Minor CMake improvements
     66                * Set the version to 'hg-tip' if everything fails
     67          #311: Add missing 'explicit' keywords
     68          #302: Fix the implementation and doc of CrossRefMap
     69          #308: Remove duplicate list_graph.h entry from source list
     70          #307: Bugfix in Preflow and Circulation
     71          #305: Bugfix and extension in the rename script
     72          #312: Also check ReferenceMapTag in concept checks
     73          #250: Bugfix in pathSource() and pathTarget()
     74          #321: Use pathCopy(from,to) instead of copyPath(to,from)
     75          #322: Add LEMONConfig.cmake.in to Makefile.am
     76          #330: Bug fix in map_extender.h
     77          #336: Fix the date field comment of graphToEps() output
     78          #323: Bug fix in Suurballe
     79          #332: ???
     80
    1812009-05-13 Version 1.1 released
    282
    383        This is the second stable release of the 1.x series. It
     
    72152          ----: Minor clarification in the LICENSE file
    73153          ----: Add missing unistd.h include to time_measure.h
    74154          #204: Compilation bug fixed in graph_to_eps.h with VS2005
    75           #214,#215: windows.h should never be included by lemon headers
     155          #214,#215: windows.h should never be included by LEMON headers
    76156          #230: Build systems check the availability of 'long long' type
    77157          #229: Default implementation of Tolerance<> is used for integer types
    78158          #211,#212: Various fixes for compiling on AIX
     
    94174
    951752008-10-13 Version 1.0 released
    96176
    97         This is the first stable release of LEMON. Compared to the 0.x
    98         release series, it features a considerably smaller but more
    99         matured set of tools. The API has also completely revised and
    100         changed in several places.
     177        This is the first stable release of LEMON. Compared to the 0.x
     178        release series, it features a considerably smaller but more
     179        matured set of tools. The API has also completely revised and
     180        changed in several places.
    101181
    102         * The major name changes compared to the 0.x series (see the
     182        * The major name changes compared to the 0.x series (see the
    103183          Migration Guide in the doc for more details)
    104184          * Graph -> Digraph, UGraph -> Graph
    105185          * Edge -> Arc, UEdge -> Edge
    106           * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge)
    107         * Other improvements
    108           * Better documentation
    109           * Reviewed and cleaned up codebase
    110           * CMake based build system (along with the autotools based one)
    111         * Contents of the library (ported from 0.x)
    112           * Algorithms
    113             * breadth-first search (bfs.h)
    114             * depth-first search (dfs.h)
    115             * Dijkstra's algorithm (dijkstra.h)
    116             * Kruskal's algorithm (kruskal.h)
    117           * Data structures
    118             * graph data structures (list_graph.h, smart_graph.h)
    119             * path data structures (path.h)
    120             * binary heap data structure (bin_heap.h)
    121             * union-find data structures (unionfind.h)
    122             * miscellaneous property maps (maps.h)
    123             * two dimensional vector and bounding box (dim2.h)
     186          * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge)
     187        * Other improvements
     188          * Better documentation
     189          * Reviewed and cleaned up codebase
     190          * CMake based build system (along with the autotools based one)
     191        * Contents of the library (ported from 0.x)
     192          * Algorithms
     193            * breadth-first search (bfs.h)
     194            * depth-first search (dfs.h)
     195            * Dijkstra's algorithm (dijkstra.h)
     196            * Kruskal's algorithm (kruskal.h)
     197          * Data structures
     198            * graph data structures (list_graph.h, smart_graph.h)
     199            * path data structures (path.h)
     200            * binary heap data structure (bin_heap.h)
     201            * union-find data structures (unionfind.h)
     202            * miscellaneous property maps (maps.h)
     203            * two dimensional vector and bounding box (dim2.h)
    124204          * Concepts
    125             * graph structure concepts (concepts/digraph.h, concepts/graph.h,
     205            * graph structure concepts (concepts/digraph.h, concepts/graph.h,
    126206              concepts/graph_components.h)
    127             * concepts for other structures (concepts/heap.h, concepts/maps.h,
    128               concepts/path.h)
    129           * Tools
    130             * Mersenne twister random number generator (random.h)
    131             * tools for measuring cpu and wall clock time (time_measure.h)
    132             * tools for counting steps and events (counter.h)
    133             * tool for parsing command line arguments (arg_parser.h)
    134             * tool for visualizing graphs (graph_to_eps.h)
    135             * tools for reading and writing data in LEMON Graph Format
     207            * concepts for other structures (concepts/heap.h, concepts/maps.h,
     208              concepts/path.h)
     209          * Tools
     210            * Mersenne twister random number generator (random.h)
     211            * tools for measuring cpu and wall clock time (time_measure.h)
     212            * tools for counting steps and events (counter.h)
     213            * tool for parsing command line arguments (arg_parser.h)
     214            * tool for visualizing graphs (graph_to_eps.h)
     215            * tools for reading and writing data in LEMON Graph Format
    136216              (lgf_reader.h, lgf_writer.h)
    137217            * tools to handle the anomalies of calculations with
    138               floating point numbers (tolerance.h)
     218              floating point numbers (tolerance.h)
    139219            * tools to manage RGB colors (color.h)
    140           * Infrastructure
    141             * extended assertion handling (assert.h)
    142             * exception classes and error handling (error.h)
    143             * concept checking (concept_check.h)
    144             * commonly used mathematical constants (math.h)
     220          * Infrastructure
     221            * extended assertion handling (assert.h)
     222            * exception classes and error handling (error.h)
     223            * concept checking (concept_check.h)
     224            * commonly used mathematical constants (math.h)