iterable_maps.h header hes been added. Up to now it contains an iterable bool
map and specialized versions for Node and Edge maps.
     1 2005-??-??  Version 0.5 Released
 
     6 2005-08-27  Version 0.4 Released
 
     7 	* List of new features and changes	
 
    10 	    kruskalEdgeMap() -> kruskal()
 
    11 	    kruskalEdgeMap_IteratorOut() -> kruskal()
 
    13 	    * operator+=() -> add()
 
    15 	  + More and better graph I/O functionalities
 
    16 	  + High level uniform LP solver interface to CPLEX and GLKP
 
    18 	    + Automatic node size and edge width scaling
 
    19 	    + Simple color palette tool (ColorSet)
 
    21 	    + Step-by-step execution
 
    22 	    + Run from multiple sources
 
    23 	    + Used define stop condition
 
    24 	    + Improved "named parameters"
 
    26 	    + Function type interface
 
    29 	    + split() splits a node
 
    32 	  + New convenience maps
 
    33 	    + IdMap, DescriptorMap
 
    36 	  + Default graph maps are iterable
 
    37 	  + glemon: a graph editor
 
    38 	  + Some new demo codes added, the old ones got polished.
 
    39 	  * Better documentation
 
    40 	  * Several important bugfixes
 
    41 	  * Now lemon should compile without warnings with
 
    43 	    * Intel C++ Compiler v9.0 
 
    45 2005-03-19  Version 0.3.1 Released
 
    46 	* This release fixes a compilation failure bug under cygwin. 
 
    48 2005-02-21  Version 0.3 released
 
    49 	* List of new features and changes	
 
    50 	  * Redesigned Graph infrastructures
 
    51 	  + Standardized LEMON exceptions
 
    53 	  + Standard graph file format, input and output classes for it.
 
    54 	  * head() -> target(), tail() -> source()
 
    55 	  * Some standard namings have changes:
 
    58 	    ReferenceType ->Reference,
 
    59 	    PointerType -> Pointer
 
    60 	  + GraphToEps: A simple graph drawer
 
    61 	  * Better documentation
 
    63 2004-09-30  Version 0.2 released