14 	    + fredman_tarjan.h and prim.h for min cost trees  | 
    14 	    + fredman_tarjan.h and prim.h for min cost trees  | 
    15 	  - Bipartite graph concept and implementations  | 
    15 	  - Bipartite graph concept and implementations  | 
    16 	  - Graph maps:  | 
    16 	  - Graph maps:  | 
    17 	    + template assign operator  | 
    17 	    + template assign operator  | 
    18 	    + specialized iterable bool map  | 
    18 	    + specialized iterable bool map  | 
    19 	    + potencial difference map  | 
    19 	    + potential difference map  | 
    20 	    + NodeMatrixMap -- Matrix over the nodes  | 
    20 	    + NodeMatrixMap -- Matrix over the nodes  | 
    21 	  - Maps:  | 
    21 	  - Maps:  | 
    22 	    + IterableIntMap  | 
    22 	    + IterableIntMap  | 
    23 	  - GUI:  | 
    23 	  - GUI:  | 
    24 	    + NewMap window in MapSelector  | 
    24 	    + NewMap window in MapSelector  | 
    44 	  - NewEdgeSetAdaptor -> ListEdgeSet  | 
    44 	  - NewEdgeSetAdaptor -> ListEdgeSet  | 
    45 	  - LP: set{Obj,Row,Col}() -> {obj,row,col}() | 
    45 	  - LP: set{Obj,Row,Col}() -> {obj,row,col}() | 
    46 	  - "label" instead of "id" inside the LGF files  | 
    46 	  - "label" instead of "id" inside the LGF files  | 
    47 	  - UndirGraph -> UGraph, UndirEdge* -> UEdge*  | 
    47 	  - UndirGraph -> UGraph, UndirEdge* -> UEdge*  | 
    48 	  - BipartiteGraph -> BpGraph, Lower/UpperNode* -> A/BNode*  | 
    48 	  - BipartiteGraph -> BpGraph, Lower/UpperNode* -> A/BNode*  | 
    49 	* Buxfixes in  | 
    49 	* Bugfixes in  | 
    50 	  - DFS  | 
    50 	  - DFS  | 
    51 	  - Preflow  | 
    51 	  - Preflow  | 
    52 	  - x86_64 connected bugfixes (lemon_reader.h)  | 
    52 	  - x86_64 connected bugfixes (lemon_reader.h)  | 
    53 	  - lp.h  | 
    53 	  - lp.h  | 
    54 	* New demos, benchmarks and tools:  | 
    54 	* New demos, benchmarks and tools:  | 
    55 	  - graph_orientation.cc: A thoroughly documented demo application  | 
    55 	  - graph_orientation.cc: A thoroughly documented demo application  | 
    56 	  - runningTimeTest(): a tool to measure running times more precisely  | 
    56 	  - runningTimeTest(): a tool to measure running times more precisely  | 
    57 	  - Demo for topology  | 
    57 	  - Demo for topology  | 
    58 	  - counter.h: a tool to measure the number of streps of algorithms  | 
    58 	  - counter.h: a tool to measure the number of steps of algorithms  | 
    59 	  - Some useful scripts: check-compiler, check-integrity  | 
    59 	  - Some useful scripts: check-compiler, check-integrity  | 
    60 	* Other changes:  | 
    60 	* Other changes:  | 
    61 	  - Demos and benchmarks are not built by default now. They can be  | 
    61 	  - Demos and benchmarks are not built by default now. They can be  | 
    62 	    enabled with the --enable-demo and --enable-benchmark  | 
    62 	    enabled with the --enable-demo and --enable-benchmark  | 
    63 	    configure flags.  | 
    63 	    configure flags.  |