1 2005-??-?? Version 0.5 Released |
1 2005-??-?? Version 0.5 Released |
|
2 * New features: |
|
3 - Bfs/Dfs/Dijkstra |
|
4 + query functions for the next node/edge to be processed |
|
5 + visitor interface for dfs |
|
6 - topology.h: small functions for discovering graph topology |
|
7 + connected components, strongly connected components |
|
8 + bipartiteness testing |
|
9 - Shortest paths algorithms: |
|
10 bellman_ford.h, floyd_warshall.h, johnson.h |
|
11 - Euler tour iterator for directed and undirected graphs |
|
12 - Other algorithms: |
|
13 + dag_shortest_path.h |
|
14 + fredman_tarjan.h and prim.h for min cost trees |
|
15 - Bipartite graph concept and implementations |
|
16 - Graph maps: |
|
17 + template assign operator |
|
18 + specialized iterable bool map |
|
19 + potencial difference map |
|
20 + NodeMatrixMap -- Matrix over the nodes |
|
21 - Maps: |
|
22 + IterableIntMap |
|
23 - GUI: |
|
24 + NewMap window in MapSelector |
|
25 + Algorithm window and some algorithms (eg. Kruskal) added |
|
26 - LemonReader: |
|
27 + exception on non-existent files |
|
28 - LP interface: |
|
29 + (Dual)Expr::simplify(double tolerance) added |
|
30 + getDual() |
|
31 - GraphToEps: |
|
32 + negateY() opt |
|
33 + male/female node shapes :) |
|
34 + correct BoundingBor handling |
|
35 - Tools: |
|
36 + Timer can be stop()ed and (re)start()ed |
|
37 + radix sort algo |
|
38 + tolerance.h for working with imprecise numbers |
2 * Changed namings: |
39 * Changed namings: |
3 - Access functions of TimeStamp/Timer |
40 - Access functions of TimeStamp/Timer |
4 * Buxfix in |
41 - Undir graph interface: findUndirEdge, ConUndirEdgeIt |
|
42 - pred -> predEdge renaming in search algorithms |
|
43 - SnapShot -> Snapshot in {List,Smart}Graph |
|
44 - NewEdgeSetAdaptor -> ListEdgeSet |
|
45 - LP: set{Obj,Row,Col}() -> {obj,row,col}() |
|
46 - "label" instead of "id" inside the LGF files |
|
47 - UndirGraph -> UGraph, UndirEdge* -> UEdge* |
|
48 - BipartiteGraph -> BpGraph, Lower/UpperNode* -> A/BNode* |
|
49 * Buxfixes in |
5 - DFS |
50 - DFS |
6 - Preflow |
51 - Preflow |
|
52 - x86_64 connected bugfixes (lemon_reader.h) |
|
53 - lp.h |
|
54 * New demos, benchmarks and tools: |
|
55 - graph_orientation.cc: A thoroughly documented demo application |
|
56 - runningTimeTest(): a tool to measure running times more precisely |
|
57 - Demo for topology |
|
58 - counter.h: a tool to measure the number of streps of algorithms |
|
59 - Some useful scripts: check-compiler, check-integrity |
|
60 * Other changes: |
|
61 - Demos and benchmarks are not built by default now. They can be |
|
62 enabled with the --enable-demo and --enable-benchmark |
|
63 configure flags. |
|
64 - GCC 4.0.3 and ICC 9.0 compatibility |
7 |
65 |
8 2005-08-27 Version 0.4 Released |
66 2005-08-27 Version 0.4 Released |
9 * List of new features and changes |
67 * List of new features and changes |
10 * Changed namings: |
68 * Changed namings: |
11 Wrapper -> Adaptor |
69 Wrapper -> Adaptor |