|
athos@2075
|
1 |
2006-02-03 Version 0.5 Released
|
|
klao@1945
|
2 |
* New features:
|
|
klao@1945
|
3 |
- Bfs/Dfs/Dijkstra
|
|
klao@1945
|
4 |
+ query functions for the next node/edge to be processed
|
|
klao@1945
|
5 |
+ visitor interface for dfs
|
|
klao@1945
|
6 |
- topology.h: small functions for discovering graph topology
|
|
klao@1945
|
7 |
+ connected components, strongly connected components
|
|
klao@1945
|
8 |
+ bipartiteness testing
|
|
klao@1945
|
9 |
- Shortest paths algorithms:
|
|
klao@1945
|
10 |
bellman_ford.h, floyd_warshall.h, johnson.h
|
|
klao@1945
|
11 |
- Euler tour iterator for directed and undirected graphs
|
|
klao@1945
|
12 |
- Other algorithms:
|
|
klao@1945
|
13 |
+ dag_shortest_path.h
|
|
klao@1945
|
14 |
+ fredman_tarjan.h and prim.h for min cost trees
|
|
klao@1945
|
15 |
- Bipartite graph concept and implementations
|
|
klao@1945
|
16 |
- Graph maps:
|
|
klao@1945
|
17 |
+ template assign operator
|
|
klao@1945
|
18 |
+ specialized iterable bool map
|
|
athos@2075
|
19 |
+ potential difference map
|
|
klao@1945
|
20 |
+ NodeMatrixMap -- Matrix over the nodes
|
|
klao@1945
|
21 |
- Maps:
|
|
klao@1945
|
22 |
+ IterableIntMap
|
|
klao@1945
|
23 |
- GUI:
|
|
klao@1945
|
24 |
+ NewMap window in MapSelector
|
|
klao@1945
|
25 |
+ Algorithm window and some algorithms (eg. Kruskal) added
|
|
klao@1945
|
26 |
- LemonReader:
|
|
klao@1945
|
27 |
+ exception on non-existent files
|
|
klao@1945
|
28 |
- LP interface:
|
|
klao@1945
|
29 |
+ (Dual)Expr::simplify(double tolerance) added
|
|
klao@1945
|
30 |
+ getDual()
|
|
klao@1945
|
31 |
- GraphToEps:
|
|
klao@1945
|
32 |
+ negateY() opt
|
|
klao@1945
|
33 |
+ male/female node shapes :)
|
|
alpar@1947
|
34 |
+ correct %%BoundingBox handling
|
|
klao@1945
|
35 |
- Tools:
|
|
klao@1945
|
36 |
+ Timer can be stop()ed and (re)start()ed
|
|
alpar@1947
|
37 |
+ radix sort algorithm
|
|
klao@1945
|
38 |
+ tolerance.h for working with imprecise numbers
|
|
alpar@1947
|
39 |
* Backward incompatibilities/changed namings:
|
|
alpar@1713
|
40 |
- Access functions of TimeStamp/Timer
|
|
alpar@1947
|
41 |
- Undir graph interface: findUEdge, ConUEdgeIt
|
|
klao@1945
|
42 |
- pred -> predEdge renaming in search algorithms
|
|
klao@1945
|
43 |
- SnapShot -> Snapshot in {List,Smart}Graph
|
|
klao@1945
|
44 |
- NewEdgeSetAdaptor -> ListEdgeSet
|
|
klao@1945
|
45 |
- LP: set{Obj,Row,Col}() -> {obj,row,col}()
|
|
klao@1945
|
46 |
- "label" instead of "id" inside the LGF files
|
|
klao@1945
|
47 |
- UndirGraph -> UGraph, UndirEdge* -> UEdge*
|
|
klao@1945
|
48 |
- BipartiteGraph -> BpGraph, Lower/UpperNode* -> A/BNode*
|
|
athos@2075
|
49 |
* Bugfixes in
|
|
alpar@1668
|
50 |
- DFS
|
|
alpar@1668
|
51 |
- Preflow
|
|
klao@1945
|
52 |
- x86_64 connected bugfixes (lemon_reader.h)
|
|
klao@1945
|
53 |
- lp.h
|
|
klao@1945
|
54 |
* New demos, benchmarks and tools:
|
|
klao@1945
|
55 |
- graph_orientation.cc: A thoroughly documented demo application
|
|
klao@1945
|
56 |
- runningTimeTest(): a tool to measure running times more precisely
|
|
klao@1945
|
57 |
- Demo for topology
|
|
athos@2075
|
58 |
- counter.h: a tool to measure the number of steps of algorithms
|
|
klao@1945
|
59 |
- Some useful scripts: check-compiler, check-integrity
|
|
klao@1945
|
60 |
* Other changes:
|
|
klao@1945
|
61 |
- Demos and benchmarks are not built by default now. They can be
|
|
klao@1945
|
62 |
enabled with the --enable-demo and --enable-benchmark
|
|
klao@1945
|
63 |
configure flags.
|
|
klao@1945
|
64 |
- GCC 4.0.3 and ICC 9.0 compatibility
|
|
alpar@1713
|
65 |
|
|
alpar@1668
|
66 |
2005-08-27 Version 0.4 Released
|
|
alpar@1668
|
67 |
* List of new features and changes
|
|
alpar@1713
|
68 |
* Changed namings:
|
|
alpar@1668
|
69 |
Wrapper -> Adaptor
|
|
alpar@1668
|
70 |
kruskalEdgeMap() -> kruskal()
|
|
alpar@1668
|
71 |
kruskalEdgeMap_IteratorOut() -> kruskal()
|
|
alpar@1668
|
72 |
* BoundinBox<>
|
|
alpar@1668
|
73 |
* operator+=() -> add()
|
|
alpar@1668
|
74 |
+ clear()
|
|
alpar@1668
|
75 |
+ More and better graph I/O functionalities
|
|
alpar@1668
|
76 |
+ High level uniform LP solver interface to CPLEX and GLKP
|
|
alpar@1668
|
77 |
* graphToEps()
|
|
alpar@1668
|
78 |
+ Automatic node size and edge width scaling
|
|
alpar@1668
|
79 |
+ Simple color palette tool (ColorSet)
|
|
alpar@1668
|
80 |
* Bfs/Dfs/Dijkstra
|
|
alpar@1668
|
81 |
+ Step-by-step execution
|
|
alpar@1668
|
82 |
+ Run from multiple sources
|
|
alpar@1668
|
83 |
+ Used define stop condition
|
|
alpar@1668
|
84 |
+ Improved "named parameters"
|
|
alpar@1668
|
85 |
* Preflow
|
|
alpar@1668
|
86 |
+ Function type interface
|
|
alpar@1668
|
87 |
+ Changed interface
|
|
alpar@1668
|
88 |
* ListGraph/SmarGraph
|
|
ladanyi@1670
|
89 |
+ split() splits a node
|
|
alpar@1668
|
90 |
+ SnapShot
|
|
alpar@1668
|
91 |
+ New map adaptors
|
|
ladanyi@1670
|
92 |
+ New convenience maps
|
|
alpar@1668
|
93 |
+ IdMap, DescriptorMap
|
|
alpar@1668
|
94 |
+ InDegMap, OutDegMap
|
|
alpar@1668
|
95 |
+ XMap, YMap
|
|
alpar@1668
|
96 |
+ Default graph maps are iterable
|
|
alpar@1668
|
97 |
+ glemon: a graph editor
|
|
alpar@1668
|
98 |
+ Some new demo codes added, the old ones got polished.
|
|
alpar@1668
|
99 |
* Better documentation
|
|
alpar@1668
|
100 |
* Several important bugfixes
|
|
alpar@1668
|
101 |
* Now lemon should compile without warnings with
|
|
alpar@1668
|
102 |
* gcc 3.3, 3.4, 4.0
|
|
alpar@1668
|
103 |
* Intel C++ Compiler v9.0
|
|
alpar@1668
|
104 |
|
|
alpar@1668
|
105 |
2005-03-19 Version 0.3.1 Released
|
|
alpar@1668
|
106 |
* This release fixes a compilation failure bug under cygwin.
|
|
alpar@1668
|
107 |
|
|
alpar@1668
|
108 |
2005-02-21 Version 0.3 released
|
|
alpar@1668
|
109 |
* List of new features and changes
|
|
alpar@1668
|
110 |
* Redesigned Graph infrastructures
|
|
alpar@1668
|
111 |
+ Standardized LEMON exceptions
|
|
alpar@1668
|
112 |
+ Undirected Graph
|
|
alpar@1668
|
113 |
+ Standard graph file format, input and output classes for it.
|
|
alpar@1668
|
114 |
* head() -> target(), tail() -> source()
|
|
alpar@1668
|
115 |
* Some standard namings have changes:
|
|
alpar@1668
|
116 |
ValueType -> Value,
|
|
alpar@1668
|
117 |
KeyType -> Key,
|
|
alpar@1668
|
118 |
ReferenceType ->Reference,
|
|
alpar@1668
|
119 |
PointerType -> Pointer
|
|
alpar@1668
|
120 |
+ GraphToEps: A simple graph drawer
|
|
alpar@1668
|
121 |
* Better documentation
|
|
alpar@1668
|
122 |
|
|
alpar@1668
|
123 |
2004-09-30 Version 0.2 released
|
|
alpar@1668
|
124 |
|