1.1 --- a/NEWS	Thu Feb 02 15:53:01 2006 +0000
     1.2 +++ b/NEWS	Thu Feb 02 17:09:09 2006 +0000
     1.3 @@ -1,9 +1,67 @@
     1.4  2005-??-??  Version 0.5 Released
     1.5 +	* New features:
     1.6 +	  - Bfs/Dfs/Dijkstra
     1.7 +	    + query functions for the next node/edge to be processed
     1.8 +	    + visitor interface for dfs
     1.9 +	  - topology.h: small functions for discovering graph topology
    1.10 +	    + connected components, strongly connected components
    1.11 +	    + bipartiteness testing
    1.12 +	  - Shortest paths algorithms:
    1.13 +	    bellman_ford.h, floyd_warshall.h, johnson.h
    1.14 +	  - Euler tour iterator for directed and undirected graphs
    1.15 +	  - Other algorithms:
    1.16 +	    + dag_shortest_path.h
    1.17 +	    + fredman_tarjan.h and prim.h for min cost trees
    1.18 +	  - Bipartite graph concept and implementations
    1.19 +	  - Graph maps:
    1.20 +	    + template assign operator
    1.21 +	    + specialized iterable bool map
    1.22 +	    + potencial difference map
    1.23 +	    + NodeMatrixMap -- Matrix over the nodes
    1.24 +	  - Maps:
    1.25 +	    + IterableIntMap
    1.26 +	  - GUI:
    1.27 +	    + NewMap window in MapSelector
    1.28 +	    + Algorithm window and some algorithms (eg. Kruskal) added
    1.29 +	  - LemonReader:
    1.30 +	    + exception on non-existent files
    1.31 +	  - LP interface:
    1.32 +	    + (Dual)Expr::simplify(double tolerance) added
    1.33 +	    + getDual()
    1.34 +	  - GraphToEps:
    1.35 +	    + negateY() opt
    1.36 +	    + male/female node shapes :)
    1.37 +	    + correct BoundingBor handling
    1.38 +	  - Tools:
    1.39 +	    + Timer can be stop()ed and (re)start()ed
    1.40 +	    + radix sort algo
    1.41 +	    + tolerance.h for working with imprecise numbers
    1.42  	* Changed namings:
    1.43  	  - Access functions of TimeStamp/Timer
    1.44 -	* Buxfix in
    1.45 +	  - Undir graph interface: findUndirEdge, ConUndirEdgeIt
    1.46 +	  - pred -> predEdge renaming in search algorithms
    1.47 +	  - SnapShot -> Snapshot in {List,Smart}Graph
    1.48 +	  - NewEdgeSetAdaptor -> ListEdgeSet
    1.49 +	  - LP: set{Obj,Row,Col}() -> {obj,row,col}()
    1.50 +	  - "label" instead of "id" inside the LGF files
    1.51 +	  - UndirGraph -> UGraph, UndirEdge* -> UEdge*
    1.52 +	  - BipartiteGraph -> BpGraph, Lower/UpperNode* -> A/BNode*
    1.53 +	* Buxfixes in
    1.54  	  - DFS
    1.55  	  - Preflow
    1.56 +	  - x86_64 connected bugfixes (lemon_reader.h)
    1.57 +	  - lp.h
    1.58 +	* New demos, benchmarks and tools:
    1.59 +	  - graph_orientation.cc: A thoroughly documented demo application
    1.60 +	  - runningTimeTest(): a tool to measure running times more precisely
    1.61 +	  - Demo for topology
    1.62 +	  - counter.h: a tool to measure the number of streps of algorithms
    1.63 +	  - Some useful scripts: check-compiler, check-integrity
    1.64 +	* Other changes:
    1.65 +	  - Demos and benchmarks are not built by default now. They can be
    1.66 +	    enabled with the --enable-demo and --enable-benchmark
    1.67 +	    configure flags.
    1.68 +	  - GCC 4.0.3 and ICC 9.0 compatibility
    1.69  	  
    1.70  2005-08-27  Version 0.4 Released
    1.71  	* List of new features and changes