[Lemon-commits] [lemon_svn] klao: r2520 - hugo/trunk
Lemon SVN
svn at lemon.cs.elte.hu
Mon Nov 6 20:53:14 CET 2006
Author: klao
Date: Thu Feb 2 18:09:09 2006
New Revision: 2520
Modified:
hugo/trunk/NEWS
Log:
NEWS: major changes since 0.4 added
Modified: hugo/trunk/NEWS
==============================================================================
--- hugo/trunk/NEWS (original)
+++ hugo/trunk/NEWS Thu Feb 2 18:09:09 2006
@@ -1,9 +1,67 @@
2005-??-?? Version 0.5 Released
+ * New features:
+ - Bfs/Dfs/Dijkstra
+ + query functions for the next node/edge to be processed
+ + visitor interface for dfs
+ - topology.h: small functions for discovering graph topology
+ + connected components, strongly connected components
+ + bipartiteness testing
+ - Shortest paths algorithms:
+ bellman_ford.h, floyd_warshall.h, johnson.h
+ - Euler tour iterator for directed and undirected graphs
+ - Other algorithms:
+ + dag_shortest_path.h
+ + fredman_tarjan.h and prim.h for min cost trees
+ - Bipartite graph concept and implementations
+ - Graph maps:
+ + template assign operator
+ + specialized iterable bool map
+ + potencial difference map
+ + NodeMatrixMap -- Matrix over the nodes
+ - Maps:
+ + IterableIntMap
+ - GUI:
+ + NewMap window in MapSelector
+ + Algorithm window and some algorithms (eg. Kruskal) added
+ - LemonReader:
+ + exception on non-existent files
+ - LP interface:
+ + (Dual)Expr::simplify(double tolerance) added
+ + getDual()
+ - GraphToEps:
+ + negateY() opt
+ + male/female node shapes :)
+ + correct BoundingBor handling
+ - Tools:
+ + Timer can be stop()ed and (re)start()ed
+ + radix sort algo
+ + tolerance.h for working with imprecise numbers
* Changed namings:
- Access functions of TimeStamp/Timer
- * Buxfix in
+ - Undir graph interface: findUndirEdge, ConUndirEdgeIt
+ - pred -> predEdge renaming in search algorithms
+ - SnapShot -> Snapshot in {List,Smart}Graph
+ - NewEdgeSetAdaptor -> ListEdgeSet
+ - LP: set{Obj,Row,Col}() -> {obj,row,col}()
+ - "label" instead of "id" inside the LGF files
+ - UndirGraph -> UGraph, UndirEdge* -> UEdge*
+ - BipartiteGraph -> BpGraph, Lower/UpperNode* -> A/BNode*
+ * Buxfixes in
- DFS
- Preflow
+ - x86_64 connected bugfixes (lemon_reader.h)
+ - lp.h
+ * New demos, benchmarks and tools:
+ - graph_orientation.cc: A thoroughly documented demo application
+ - runningTimeTest(): a tool to measure running times more precisely
+ - Demo for topology
+ - counter.h: a tool to measure the number of streps of algorithms
+ - Some useful scripts: check-compiler, check-integrity
+ * Other changes:
+ - Demos and benchmarks are not built by default now. They can be
+ enabled with the --enable-demo and --enable-benchmark
+ configure flags.
+ - GCC 4.0.3 and ICC 9.0 compatibility
2005-08-27 Version 0.4 Released
* List of new features and changes
More information about the Lemon-commits
mailing list