1.1 --- a/NEWS	Tue Apr 08 16:01:28 2008 +0000
     1.2 +++ b/NEWS	Thu Apr 17 21:28:21 2008 +0000
     1.3 @@ -13,8 +13,7 @@
     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 for minimum cut algorithms
     1.8 -			  (http://www.avglab.com/andrew/pub/neci-tr-96-132.ps)
     1.9 +			* two heuristics for minimum cut algorithms (http://www.avglab.com/andrew/pub/neci-tr-96-132.ps)
    1.10  			* Gomory-Hu tree algorithm
    1.11  			* Edmond's Blossom shrinking algorithm
    1.12  			* minimum mean cycle algorithm
    1.13 @@ -238,7 +237,7 @@
    1.14  		+ GraphToEps:
    1.15  			* negateY() opt
    1.16  			* male/female node shapes :)
    1.17 -			* correct BoundingBox handling
    1.18 +			* correct %%BoundingBox handling
    1.19  	Backward incompatibilities/changed namings:
    1.20  		* Access functions of TimeStamp/Timer
    1.21  		* Undirected graph interface: findUEdge, ConUEdgeIt