Several changes. \n If new map is added to mapstorage it emits signal with the name of the new map. This was important, because from now on not only tha mapwin should be updated. \n Furthermore algobox gets a pointer to mapstorage instead of only the mapnames from it. This is important because without it it would be complicated to pass all of the required maps to algobox.
1 2005-??-?? Version 0.5 Released
3 - Access functions of TimeStamp/Timer
8 2005-08-27 Version 0.4 Released
9 * List of new features and changes
12 kruskalEdgeMap() -> kruskal()
13 kruskalEdgeMap_IteratorOut() -> kruskal()
15 * operator+=() -> add()
17 + More and better graph I/O functionalities
18 + High level uniform LP solver interface to CPLEX and GLKP
20 + Automatic node size and edge width scaling
21 + Simple color palette tool (ColorSet)
23 + Step-by-step execution
24 + Run from multiple sources
25 + Used define stop condition
26 + Improved "named parameters"
28 + Function type interface
31 + split() splits a node
34 + New convenience maps
35 + IdMap, DescriptorMap
38 + Default graph maps are iterable
39 + glemon: a graph editor
40 + Some new demo codes added, the old ones got polished.
41 * Better documentation
42 * Several important bugfixes
43 * Now lemon should compile without warnings with
45 * Intel C++ Compiler v9.0
47 2005-03-19 Version 0.3.1 Released
48 * This release fixes a compilation failure bug under cygwin.
50 2005-02-21 Version 0.3 released
51 * List of new features and changes
52 * Redesigned Graph infrastructures
53 + Standardized LEMON exceptions
55 + Standard graph file format, input and output classes for it.
56 * head() -> target(), tail() -> source()
57 * Some standard namings have changes:
60 ReferenceType ->Reference,
61 PointerType -> Pointer
62 + GraphToEps: A simple graph drawer
63 * Better documentation
65 2004-09-30 Version 0.2 released