1.1 --- a/NEWS	Tue May 09 11:25:34 2006 +0000
     1.2 +++ b/NEWS	Tue May 09 14:28:02 2006 +0000
     1.3 @@ -1,4 +1,4 @@
     1.4 -2005-02-03  Version 0.5 Released
     1.5 +2006-02-03  Version 0.5 Released
     1.6  	* New features:
     1.7  	  - Bfs/Dfs/Dijkstra
     1.8  	    + query functions for the next node/edge to be processed
     1.9 @@ -16,7 +16,7 @@
    1.10  	  - Graph maps:
    1.11  	    + template assign operator
    1.12  	    + specialized iterable bool map
    1.13 -	    + potencial difference map
    1.14 +	    + potential difference map
    1.15  	    + NodeMatrixMap -- Matrix over the nodes
    1.16  	  - Maps:
    1.17  	    + IterableIntMap
    1.18 @@ -46,7 +46,7 @@
    1.19  	  - "label" instead of "id" inside the LGF files
    1.20  	  - UndirGraph -> UGraph, UndirEdge* -> UEdge*
    1.21  	  - BipartiteGraph -> BpGraph, Lower/UpperNode* -> A/BNode*
    1.22 -	* Buxfixes in
    1.23 +	* Bugfixes in
    1.24  	  - DFS
    1.25  	  - Preflow
    1.26  	  - x86_64 connected bugfixes (lemon_reader.h)
    1.27 @@ -55,7 +55,7 @@
    1.28  	  - graph_orientation.cc: A thoroughly documented demo application
    1.29  	  - runningTimeTest(): a tool to measure running times more precisely
    1.30  	  - Demo for topology
    1.31 -	  - counter.h: a tool to measure the number of streps of algorithms
    1.32 +	  - counter.h: a tool to measure the number of steps of algorithms
    1.33  	  - Some useful scripts: check-compiler, check-integrity
    1.34  	* Other changes:
    1.35  	  - Demos and benchmarks are not built by default now. They can be