1.1 --- a/NEWS Tue Apr 08 11:39:40 2008 +0000
1.2 +++ b/NEWS Tue Apr 08 14:43:44 2008 +0000
1.3 @@ -13,8 +13,8 @@
1.4 * Lagrange relaxation based algorithm for the delay constrained least cost path problem
1.5 * a preflow based general network circulation algorithm
1.6 * 2-approximation of Steiner-tree problem
1.7 - * two heuristics (http://www.avglab.com/andrew/pub/neci-tr-96-132.ps)
1.8 - * Delaunay triangulation
1.9 + * two heuristics for minimum cut algorithms
1.10 + (http://www.avglab.com/andrew/pub/neci-tr-96-132.ps)
1.11 * Gomory-Hu tree algorithm
1.12 * Edmond's Blossom shrinking algorithm
1.13 * minimum mean cycle algorithm
1.14 @@ -27,8 +27,9 @@
1.15 * minimum mean cycle canceling algorithm
1.16 * cost scaling algorithm
1.17 * network simplex algorithm
1.18 + * min cost maximum flow algorithm
1.19 + new functions and tools
1.20 - ArgParser, a command line argument parser
1.21 + * ArgParser, a command line argument parser
1.22 * DistLog, a tool for measuring one and two dimensional distributions
1.23 * undirected minimum cut benchmarking
1.24 * tools/lgf-gen.cc, a random graph generator
1.25 @@ -91,7 +92,7 @@
1.26 * conditional execution until the target is reached
1.27 * modified start() function in Dfs and Dijkstra classes to give back reached edge/node
1.28 * return the temporary distance of the current node
1.29 - * using operation traits
1.30 + * using operation traits in Dijkstra
1.31 * patch for retrieving reached/processed node
1.32 * prescaling can be turned off in GraphToEps
1.33 * better handling of inexact computations
1.34 @@ -135,7 +136,7 @@
1.35 * lower case local variables
1.36 Removed
1.37 - template Map template parameter from InvertableMaps
1.38 - - unionfind Item template parameter
1.39 + - union-find Item template parameter
1.40 - strict checking
1.41 - some automatic callback generation
1.42 - '-Wshadow' seemed too strict therefore removed
1.43 @@ -237,10 +238,10 @@
1.44 + GraphToEps:
1.45 * negateY() opt
1.46 * male/female node shapes :)
1.47 - * correct %%BoundingBox handling
1.48 + * correct BoundingBox handling
1.49 Backward incompatibilities/changed namings:
1.50 * Access functions of TimeStamp/Timer
1.51 - * Undir graph interface: findUEdge, ConUEdgeIt
1.52 + * Undirected graph interface: findUEdge, ConUEdgeIt
1.53 * pred -> predEdge renaming in search algorithms
1.54 * SnapShot -> Snapshot in {List,Smart}Graph
1.55 * NewEdgeSetAdaptor -> ListEdgeSet
1.56 @@ -281,9 +282,9 @@
1.57 * Used define stop condition
1.58 * Improved "named parameters"
1.59 + Preflow
1.60 + * Changed interface
1.61 * Function type interface
1.62 - * Changed interface
1.63 - + ListGraph/SmarGraph
1.64 + + ListGraph/SmartGraph
1.65 * split() splits a node
1.66 * SnapShot
1.67 Changes
1.68 @@ -296,7 +297,7 @@
1.69 + clear()
1.70 * Better documentation
1.71 * Several important bugfixes
1.72 - * Now lemon should compile without warnings with
1.73 + * Now LEMON should compile without warnings with
1.74 * gcc 3.3, 3.4, 4.0
1.75 * Intel C++ Compiler v9.0
1.76
1.77 @@ -304,11 +305,10 @@
1.78 This release fixes a compilation failure bug under cygwin.
1.79
1.80 2005-02-21 Version 0.3 released
1.81 -
1.82 New features
1.83 + Standardized LEMON exceptions
1.84 + Undirected Graph
1.85 - + Standard graph file format, input and output classes for it.
1.86 + + Standard graph file format, input and output classes for it
1.87 + GraphToEps: A simple graph drawer
1.88 Changes
1.89 * Redesigned Graph infrastructures
1.90 @@ -316,7 +316,7 @@
1.91 * Some standard namings have changes:
1.92 ValueType -> Value,
1.93 KeyType -> Key,
1.94 - ReferenceType ->Reference,
1.95 + ReferenceType -> Reference,
1.96 PointerType -> Pointer
1.97 * Better documentation
1.98