# HG changeset patch
# User kpeter
# Date 1207665824 0
# Node ID 5f36105d656b3ebdc9e2124919480917007008a0
# Parent  1c7790d9e0254ef0a80a6559fe54d8f25d6b8852
Small fixes in NEWS file

diff -r 1c7790d9e025 -r 5f36105d656b NEWS
--- a/NEWS	Tue Apr 08 11:39:40 2008 +0000
+++ b/NEWS	Tue Apr 08 14:43:44 2008 +0000
@@ -13,8 +13,8 @@
 			* Lagrange relaxation based algorithm for the delay constrained least cost path problem
 			* a preflow based general network circulation algorithm
 			* 2-approximation of Steiner-tree problem
-			* two heuristics (http://www.avglab.com/andrew/pub/neci-tr-96-132.ps)
-			* Delaunay triangulation
+			* two heuristics for minimum cut algorithms
+			  (http://www.avglab.com/andrew/pub/neci-tr-96-132.ps)
 			* Gomory-Hu tree algorithm
 			* Edmond's Blossom shrinking algorithm
 			* minimum mean cycle algorithm
@@ -27,8 +27,9 @@
 				* minimum mean cycle canceling algorithm
 				* cost scaling algorithm
 				* network simplex algorithm
+			* min cost maximum flow algorithm
 		+ new functions and tools
-			ArgParser, a command line argument parser
+			* ArgParser, a command line argument parser
 			* DistLog, a tool for measuring one and two dimensional distributions
 			* undirected minimum cut benchmarking
 			* tools/lgf-gen.cc, a random graph generator
@@ -91,7 +92,7 @@
 			* conditional execution until the target is reached 
 			* modified start() function in Dfs and Dijkstra classes to give back reached edge/node
 			* return the temporary distance of the current node
-			* using operation traits
+			* using operation traits in Dijkstra
 			* patch for retrieving reached/processed node
 		* prescaling can be turned off in GraphToEps
 		* better handling of inexact computations
@@ -135,7 +136,7 @@
 		* lower case local variables
 	Removed
 		- template Map template parameter from InvertableMaps
-		- unionfind Item template parameter
+		- union-find Item template parameter
 		- strict checking
 		- some automatic callback generation 
 		- '-Wshadow' seemed too strict therefore removed
@@ -237,10 +238,10 @@
 		+ GraphToEps:
 			* negateY() opt
 			* male/female node shapes :)
-			* correct %%BoundingBox handling
+			* correct BoundingBox handling
 	Backward incompatibilities/changed namings:
 		* Access functions of TimeStamp/Timer
-		* Undir graph interface: findUEdge, ConUEdgeIt
+		* Undirected graph interface: findUEdge, ConUEdgeIt
 		* pred -> predEdge renaming in search algorithms
 		* SnapShot -> Snapshot in {List,Smart}Graph
 		* NewEdgeSetAdaptor -> ListEdgeSet
@@ -281,9 +282,9 @@
 			* Used define stop condition
 			* Improved "named parameters"
 		+ Preflow
+			* Changed interface
 			* Function type interface
-			* Changed interface
-		+ ListGraph/SmarGraph
+		+ ListGraph/SmartGraph
 			* split() splits a node
 			* SnapShot
 	Changes
@@ -296,7 +297,7 @@
 			+ clear()
 		* Better documentation
 		* Several important bugfixes
-		* Now lemon should compile without warnings with
+		* Now LEMON should compile without warnings with
 			* gcc 3.3, 3.4, 4.0
 			* Intel C++ Compiler v9.0 
 
@@ -304,11 +305,10 @@
 	This release fixes a compilation failure bug under cygwin. 
 
 2005-02-21  Version 0.3 released
-
 	New features
 		+ Standardized LEMON exceptions
 		+ Undirected Graph
-		+ Standard graph file format, input and output classes for it.
+		+ Standard graph file format, input and output classes for it
 		+ GraphToEps: A simple graph drawer
 	Changes
 		* Redesigned Graph infrastructures
@@ -316,7 +316,7 @@
 		* Some standard namings have changes:
 			ValueType -> Value, 
 			KeyType -> Key,
-			ReferenceType ->Reference,
+			ReferenceType -> Reference,
 			PointerType -> Pointer
 		* Better documentation