Rel.07 NEWS - 2. round
1.1 --- a/NEWS Mon Apr 07 16:28:20 2008 +0000
1.2 +++ b/NEWS Tue Apr 08 11:38:17 2008 +0000
1.3 @@ -1,323 +1,324 @@
1.4 2008-02-08 Version 0.7 released
1.5 -
1.6 - * added
1.7 - - new data structures
1.8 - classes
1.9 - StaticGraphBase
1.10 + New Features
1.11 + + new data structures
1.12 + * classes
1.13 + StaticGraph
1.14 ExtendFindEnum
1.15 BfsVisitor class
1.16 Bipartite partitions based on visitors
1.17 - helper class for checking existence of a nested class
1.18 - general mapping based variant type
1.19 - IntegerMap
1.20 - - new functions and tools
1.21 + * helper class for checking existence of a nested class
1.22 + * general mapping based variant type
1.23 + * IntegerMap
1.24 + + new algoritmhs
1.25 + * Lagrange relaxation based algorithm for the delay constrained least cost path problem
1.26 + * a preflow based general network circulation algorithm
1.27 + * 2-approximation of Steiner-tree problem
1.28 + * two heuristics (http://www.avglab.com/andrew/pub/neci-tr-96-132.ps)
1.29 + * tsp2, a minimum spanning tree based TSP algorithm
1.30 + * Delaunay triangulation
1.31 + * Gomory-Hu tree algorithm
1.32 + * Edmond's Blossom shrinking algorithm
1.33 + * minimum mean cycle algorithm
1.34 + * Goldberg-Tarjan algorithm (Preflow with Dynamic Trees)
1.35 + * Dinitz-Sleator-Tarjan (Blocking flow with Dynamic Tree)
1.36 + * min cost flow algorithms:
1.37 + * successive shortest path algorithm
1.38 + * capacity scaling algorithm
1.39 + * simple cycle canceling algorithm
1.40 + * minimum mean cycle canceling algorithm
1.41 + * cost scaling algorithm
1.42 + * network simplex algorithm
1.43 + + new functions and tools
1.44 ArgParser, a command line argument parser
1.45 - DistLog, a tool for measuring one and two dimensional distributions
1.46 - undirected minimum cut benchmarking
1.47 - tools/lgf-gen.cc, a random graph generator
1.48 - BpUGraphReader and Writer
1.49 - DynEdgeLookUp implementation based on splay trees
1.50 - MACROS for debug map usage
1.51 - - new algoritmhs
1.52 - Lagrange relaxation based algorithm for the delay constrained least cost path problem
1.53 - a preflow based general network circulation algorithm
1.54 - 2-approximation of Steiner-tree problem
1.55 - two heuristics (http://www.avglab.com/andrew/pub/neci-tr-96-132.ps)
1.56 - tsp2, a minimum spanning tree based TSP algorithm
1.57 - Delaunay triangulation
1.58 - Gomory-Hu tree algorithm
1.59 - Edmond's Blossom shrinking algorithm
1.60 - minimum mean cycle algorithm
1.61 - Goldberg-Tarjan algorithm (Preflow with Dynamic Trees)
1.62 - Dinitz-Sleator-Tarjan (Blocking flow with Dynamic Tree)
1.63 - - new distributions (Gaussian, exponential, Gamma, two dimensional random, buffered bit generation)
1.64 - - push-relabel type algorithm related additions
1.65 - Elevator, a class for handling item labels in push-relabel type algorithms
1.66 - a push/relabel type max cardinality matching implementation
1.67 - some query function for push-relabel based matching
1.68 - - LP related additions
1.69 - Soplex support
1.70 - ColIt class
1.71 - new functions (simplify(), isFinite(), row and col getter function)
1.72 - _setColCoeff and _setRowCoeff parameters
1.73 - section reader and writer for lemon IO
1.74 - equality-type constraint can now be added to a LP
1.75 - virtual functions of class LpCplex
1.76 - some query functions for GLPK
1.77 - - demos
1.78 - preflow based general network circulation demo
1.79 - Steiner 2-approximation demo
1.80 - demo for SAT problems
1.81 - sample input for sat-2 and sat demos
1.82 - - tests for
1.83 - graph copies
1.84 - random.h
1.85 - max weighted matchings
1.86 - - rename graphs script
1.87 - - planarity related additions
1.88 - checking and embedding
1.89 - planar grid embedding
1.90 - planar graph coloring
1.91 - - administrative improvements
1.92 - script for automatic checking of SVN commit's consistency
1.93 - automatic doc generation from the SVN trunk
1.94 - check for gcc version 3.3, 3.4, 4.0 and 4.1.2 as well
1.95 - reorganization of the modules and groups
1.96 - a tools directory added for useful executables codes
1.97 - doxygen
1.98 - renaming topology doxygen group to graph_prop doxygen group
1.99 - introducing planar doxygen group
1.100 - - bipartite matchings
1.101 - common interface
1.102 - Query functions: aMatching and bMatching
1.103 - ANodeMap<UEdge> matching map
1.104 - BNodeMap<bool> barrier map
1.105 -
1.106 - * changed, modified, improved
1.107 - - redesigned
1.108 - undirected edgesets (like the smart or ugraph)
1.109 - interface of MaxMatching and UnionFindEnum
1.110 - interface of maximum flow algorithms
1.111 - Kruskal algorithm
1.112 - augmenting path based bipartite matching
1.113 - - min cost flows
1.114 - various min cost flow solvers
1.115 - redesigned CapacityScaling algorithm
1.116 - - graph copy
1.117 - preliminary support for static graphs
1.118 - added BpUGraphCopy
1.119 - - execution
1.120 - conditional execution until the target is reached
1.121 - modified start() function in Dfs and Dijkstra classes to give back reached edge/node
1.122 - - Dijkstra
1.123 - return the temporary distance of the current node
1.124 - using operation traits
1.125 - - patch for retrieving reached/processed node in dijkstra, bfs and dfs
1.126 - - prescaling can be turned off in GraphToEps
1.127 - - better handling of inexact computation
1.128 - - easier inverse
1.129 - - faster geometric minimum spanning tree
1.130 - - new implementation of undirected graphs
1.131 - - Hao-Orlin algorithm became epsilon-safe
1.132 - - LpSoplex
1.133 - added getter functions
1.134 - better m4 file
1.135 - better handling of unsolved lps
1.136 - - allowing 'string' type quoting
1.137 - - clear() function for unionfinds
1.138 - - integer parameters also converted to double
1.139 - - hacking mip is possible without integer variables
1.140 - - space reservation for SmartGraph
1.141 - - path
1.142 - PathNodeIt
1.143 + * DistLog, a tool for measuring one and two dimensional distributions
1.144 + * undirected minimum cut benchmarking
1.145 + * tools/lgf-gen.cc, a random graph generator
1.146 + * BpUGraphReader and Writer
1.147 + * DynEdgeLookUp implementation based on splay trees
1.148 + * MACROS for debug map usage
1.149 + + new distributions (Gaussian, exponential, Gamma, two dimensional random, buffered bit generation)
1.150 + + push-relabel type algorithm related additions
1.151 + * Elevator, a class for handling item labels in push-relabel type algorithms
1.152 + * a push/relabel type max cardinality matching implementation
1.153 + * some query function for push-relabel based matching
1.154 + + LP related additions
1.155 + * Soplex support
1.156 + * ColIt class
1.157 + * new functions (simplify(), isFinite(), row and col getter function)
1.158 + * _setColCoeff and _setRowCoeff parameters
1.159 + * section reader and writer for LEMON IO
1.160 + * equality-type constraint can now be added to a LP
1.161 + * virtual functions of class LpCplex
1.162 + * some query functions for GLPK
1.163 + + demos
1.164 + * preflow based general network circulation demo
1.165 + * Steiner 2-approximation demo
1.166 + * demo for SAT problems
1.167 + * sample input for sat-2 and sat demos
1.168 + + tests for
1.169 + * graph copies
1.170 + * random.h
1.171 + * max weighted matchings
1.172 + + planarity related additions
1.173 + * checking and embedding
1.174 + * planar grid embedding
1.175 + * planar graph coloring
1.176 + + bipartite matchings
1.177 + * common interface
1.178 + * Query functions: aMatching and bMatching
1.179 + * ANodeMap<UEdge> matching map
1.180 + * BNodeMap<bool> barrier map
1.181 + Repository reorganization
1.182 + * script for automatic checking of SVN commit's consistency
1.183 + * automatic doc generation from the SVN trunk
1.184 + * check for gcc version 3.3, 3.4, 4.0 and 4.1.2 as well
1.185 + * reorganization of the modules and groups
1.186 + * a tools directory added for useful executables codes
1.187 + * doxygen
1.188 + * renaming topology doxygen group to graph_prop doxygen group
1.189 + * introducing planar doxygen group
1.190 + Changes
1.191 + * redesigned
1.192 + * undirected edgesets (like the smart graph or ugraph)
1.193 + * interface of MaxMatching and UnionFindEnum
1.194 + * interface of maximum flow algorithms
1.195 + * Kruskal algorithm
1.196 + * augmenting path based bipartite matching
1.197 + Improvements
1.198 + * graph copy
1.199 + * preliminary support for static graphs
1.200 + * added BpUGraphCopy
1.201 + * Bfs/Dfs/Dijkstra
1.202 + * conditional execution until the target is reached
1.203 + * modified start() function in Dfs and Dijkstra classes to give back reached edge/node
1.204 + * return the temporary distance of the current node
1.205 + * using operation traits
1.206 + * patch for retrieving reached/processed node
1.207 + * prescaling can be turned off in GraphToEps
1.208 + * better handling of inexact computations
1.209 + * easier inverse
1.210 + * faster geometric minimum spanning tree algorithm
1.211 + * new implementation of undirected graphs
1.212 + * Hao-Orlin algorithm became epsilon-safe
1.213 + * LpSoplex
1.214 + * added getter functions
1.215 + * better m4 file
1.216 + * better handling of unsolved lps
1.217 + * allowing 'string' type quoting for item reading and writing
1.218 + * clear() function for union-find structures
1.219 + * hacking MIP is possible without integer variables
1.220 + * space reservation for SmartGraph
1.221 + * path
1.222 + * PathNodeIt
1.223 PathWriter/Reader structures
1.224 Distinct MapSet readers and writers
1.225 - more simple interface for PathDumper
1.226 -
1.227 - * updated
1.228 - - tutorial for
1.229 - algorithms
1.230 - graph visualization
1.231 - - documentation
1.232 -
1.233 - * rename
1.234 - - min_cut.h => nagamochi_ibaraki.h
1.235 - - clone => build
1.236 - - RevIt => RevEdgeIt
1.237 - - _FixId => LpId
1.238 - - setObj => obj
1.239 - - is_min => isMin
1.240 - - is_max => isMax
1.241 - - 'hugo' => 'lemon'
1.242 - - ball2() => disc()
1.243 - - state_enum => State
1.244 - - getNotifier => notifier
1.245 - - using LEMON_ASSERT instead of LogicError()
1.246 - - uedgeset is an alias for edgeset
1.247 - - CPXMIP_OPTIMAL_TOL status is considered as OPTIMAL too
1.248 - - removed "Type" suffix from typedefs
1.249 - - lower case local variables
1.250 -
1.251 - * removed
1.252 + * more simple interface for PathDumper
1.253 + Updated
1.254 + * tutorial for
1.255 + * algorithms
1.256 + * graph visualization
1.257 + * documentation
1.258 + Backward incompatibilities/changed namings
1.259 + * min_cut.h => nagamochi_ibaraki.h
1.260 + * clone => build
1.261 + * RevIt => RevEdgeIt
1.262 + * _FixId => LpId
1.263 + * setObj => obj
1.264 + * is_min => isMin
1.265 + * is_max => isMax
1.266 + * ball2() => disc()
1.267 + * state_enum => State
1.268 + * getNotifier => notifier
1.269 + * using LEMON_ASSERT instead of LogicError()
1.270 + * uedgeset is an alias for edgeset
1.271 + * CPXMIP_OPTIMAL_TOL status is considered as OPTIMAL too
1.272 + * removed "Type" suffix from typedefs
1.273 + * lower case local variables
1.274 + Removed
1.275 - template Map template parameter from InvertableMaps
1.276 - unionfind Item template parameter
1.277 - strict checking
1.278 - some automatic callback generation
1.279 - '-Wshadow' seemed too strict therefore removed
1.280 -
1.281 - * several bugfixes
1.282 + - '-Wshadow' seemed too strict therefore removed
1.283 + Several bugfixes
1.284
1.285 2006-10-31 Version 0.6 Released
1.286 - * GLEMON has moved to a separate repository
1.287 - (https://hugo.cs.elte.hu/svn/glemon/trunk)
1.288 - * New Features
1.289 - - Mixed Integer Programming (MIP) support
1.290 - - interface to GLPK and CPLEX MIP solvers
1.291 - - Data structures
1.292 - - Bipatrite graph concepts and implementations
1.293 - - a Polinomial template class
1.294 - - RefPtr: a reference counted pointer class
1.295 - - SimpleBucketHeap
1.296 - - random.h: Mersenne Twister random number generator
1.297 - - EdgeLookUp and AllEdgeLookUp
1.298 - - Tools to find edges between to nodes in time O(log d)
1.299 - - new matching algorithms
1.300 - - Bipartite Graph Max Cardinality Matching (Hopcroft-Karp)
1.301 - - MaxWeightedBipartiteMatching
1.302 - - MinCostMaxBipartiteMatching
1.303 - - MaxCardinalitySearch
1.304 - - MinimalCut in UGraph
1.305 - - Tabu Search framework
1.306 - - Minimum Cost Arborescence algorithm
1.307 - - Edmonds-Karp MaxFlow
1.308 - - Hao-Orlin algorithm
1.309 - - eps.h: A simple tool to create .eps pictures.
1.310 - * Backward incompatibilities/changed namings:
1.311 - - UndirXyz -> UXyz
1.312 - - UNDIRGRAPH_TYPEDEFS -> UGRAPH_TYPEDEFS
1.313 - - GridGraph -> GridUGraph
1.314 - - LinearHeap -> BucketHeap
1.315 - - ColorSet -> Palette
1.316 - - xy -> dim2::Point
1.317 - - DirPath -> Path
1.318 - - concept -> concepts (namespace & directory)
1.319 - - LpSolverBase
1.320 - - ColName() -> colName
1.321 - - Coeff() -> coeff()
1.322 - - MinCostFlow -> SspMinCostFlow
1.323 - * Repository reorganization:
1.324 - - compilation is conducted by a single makefile
1.325 - - internal building blocks are now in a separate directory
1.326 - (lemon/bits)
1.327 - * Major improvements many algorithms and data structures.
1.328 - * Several bugfixes
1.329 - * Compatibility issues:
1.330 - - known to compile with
1.331 - - GCC 3.3, 3.4, 4.0, 4.1
1.332 - - MinGW, MinGW32
1.333 - - Intel C++ 9.x support
1.334 + GLEMON has moved to a separate repository
1.335 + (https://hugo.cs.elte.hu/svn/glemon/trunk)
1.336 + New Features
1.337 + + Mixed Integer Programming (MIP) support
1.338 + + interface to GLPK and CPLEX MIP solvers
1.339 + + Data structures
1.340 + * Bipatrite graph concepts and implementations
1.341 + * a Polinomial template class
1.342 + * RefPtr: a reference counted pointer class
1.343 + * SimpleBucketHeap
1.344 + + random.h: Mersenne Twister random number generator
1.345 + + EdgeLookUp and AllEdgeLookUp
1.346 + + Tools to find edges between to nodes in time O(log d)
1.347 + + new matching algorithms
1.348 + + Bipartite Graph Max Cardinality Matching (Hopcroft-Karp)
1.349 + + MaxWeightedBipartiteMatching
1.350 + + MinCostMaxBipartiteMatching
1.351 + + MaxCardinalitySearch
1.352 + + MinimalCut in UGraph
1.353 + + Tabu Search framework
1.354 + + Minimum Cost Arborescence algorithm
1.355 + + Edmonds-Karp MaxFlow
1.356 + + Hao-Orlin algorithm
1.357 + + eps.h: A simple tool to create .eps pictures.
1.358 + Backward incompatibilities/changed namings:
1.359 + * UndirXyz -> UXyz
1.360 + * UNDIRGRAPH_TYPEDEFS -> UGRAPH_TYPEDEFS
1.361 + * GridGraph -> GridUGraph
1.362 + * LinearHeap -> BucketHeap
1.363 + * ColorSet -> Palette
1.364 + * xy -> dim2::Point
1.365 + * DirPath -> Path
1.366 + * concept -> concepts (namespace & directory)
1.367 + * LpSolverBase
1.368 + * ColName() -> colName
1.369 + * Coeff() -> coeff()
1.370 + * MinCostFlow -> SspMinCostFlow
1.371 + Repository reorganization:
1.372 + * compilation is conducted by a single makefile
1.373 + * internal building blocks are now in a separate directory
1.374 + (lemon/bits)
1.375 + Major improvements of many algorithms and data structures
1.376 + Several bugfixes
1.377 + Compatibility issues:
1.378 + * known to compile with
1.379 + * GCC 3.3, 3.4, 4.0, 4.1
1.380 + * MinGW, MinGW32
1.381 + * Intel C++ 9.x support
1.382
1.383 2006-02-03 Version 0.5 Released
1.384 - * New features:
1.385 - - Bfs/Dfs/Dijkstra
1.386 - + query functions for the next node/edge to be processed
1.387 - + visitor interface for dfs
1.388 - - topology.h: small functions for discovering graph topology
1.389 - + connected components, strongly connected components
1.390 - + bipartiteness testing
1.391 - - Shortest paths algorithms:
1.392 - bellman_ford.h, floyd_warshall.h, johnson.h
1.393 - - Euler tour iterator for directed and undirected graphs
1.394 - - Other algorithms:
1.395 - + dag_shortest_path.h
1.396 - + fredman_tarjan.h and prim.h for min cost trees
1.397 - - Bipartite graph concept and implementations
1.398 - - Graph maps:
1.399 - + template assign operator
1.400 - + specialized iterable bool map
1.401 - + potential difference map
1.402 - + NodeMatrixMap -- Matrix over the nodes
1.403 - - Maps:
1.404 - + IterableIntMap
1.405 - - GUI:
1.406 - + NewMap window in MapSelector
1.407 - + Algorithm window and some algorithms (eg. Kruskal) added
1.408 - - LemonReader:
1.409 - + exception on non-existent files
1.410 - - LP interface:
1.411 - + (Dual)Expr::simplify(double tolerance) added
1.412 - + getDual()
1.413 - - GraphToEps:
1.414 - + negateY() opt
1.415 - + male/female node shapes :)
1.416 - + correct %%BoundingBox handling
1.417 - - Tools:
1.418 - + Timer can be stop()ed and (re)start()ed
1.419 - + radix sort algorithm
1.420 - + tolerance.h for working with imprecise numbers
1.421 - * Backward incompatibilities/changed namings:
1.422 - - Access functions of TimeStamp/Timer
1.423 - - Undir graph interface: findUEdge, ConUEdgeIt
1.424 - - pred -> predEdge renaming in search algorithms
1.425 - - SnapShot -> Snapshot in {List,Smart}Graph
1.426 - - NewEdgeSetAdaptor -> ListEdgeSet
1.427 - - LP: set{Obj,Row,Col}() -> {obj,row,col}()
1.428 - - "label" instead of "id" inside the LGF files
1.429 - - UndirGraph -> UGraph, UndirEdge* -> UEdge*
1.430 - - BipartiteGraph -> BpGraph, Lower/UpperNode* -> A/BNode*
1.431 - * Bugfixes in
1.432 - - DFS
1.433 - - Preflow
1.434 - - x86_64 connected bugfixes (lemon_reader.h)
1.435 - - lp.h
1.436 - * New demos, benchmarks and tools:
1.437 - - graph_orientation.cc: A thoroughly documented demo application
1.438 - - runningTimeTest(): a tool to measure running times more precisely
1.439 - - Demo for topology
1.440 - - counter.h: a tool to measure the number of steps of algorithms
1.441 - - Some useful scripts: check-compiler, check-integrity
1.442 - * Other changes:
1.443 - - Demos and benchmarks are not built by default now. They can be
1.444 - enabled with the --enable-demo and --enable-benchmark
1.445 - configure flags.
1.446 - - GCC 4.0.3 and ICC 9.0 compatibility
1.447 -
1.448 + New features
1.449 + + Shortest paths algorithms
1.450 + * bellman_ford.h
1.451 + * floyd_warshall.h
1.452 + * johnson.h
1.453 + + Euler tour iterator for directed and undirected graphs
1.454 + + Other algorithms:
1.455 + * dag_shortest_path.h
1.456 + * fredman_tarjan.h and prim.h for min cost trees
1.457 + + Bipartite graph concept and implementations
1.458 + + Graph maps:
1.459 + * template assign operator
1.460 + * specialized iterable bool map
1.461 + * potential difference map
1.462 + * NodeMatrixMap -- Matrix over the nodes
1.463 + + Maps:
1.464 + * IterableIntMap
1.465 + + Tools:
1.466 + * Timer can be stop()ed and (re)start()ed
1.467 + * radix sort algorithm
1.468 + * tolerance.h for working with imprecise numbers
1.469 + New demos, benchmarks and tools
1.470 + + graph_orientation.cc: A thoroughly documented demo application
1.471 + + runningTimeTest(): a tool to measure running times more precisely
1.472 + + Demo for topology
1.473 + + counter.h: a tool to measure the number of steps of algorithms
1.474 + + Some useful scripts: check-compiler, check-integrity
1.475 + Improvements
1.476 + + Bfs/Dfs/Dijkstra
1.477 + * query functions for the next node/edge to be processed
1.478 + * visitor interface for dfs
1.479 + + topology.h: small functions for discovering graph topology
1.480 + * connected components, strongly connected components
1.481 + * bipartiteness testing
1.482 + + GUI:
1.483 + * NewMap window in MapSelector
1.484 + * Algorithm window and some algorithms (eg. Kruskal) added
1.485 + + LemonReader:
1.486 + * exception on non-existent files
1.487 + + LP interface:
1.488 + * (Dual)Expr::simplify(double tolerance) added
1.489 + * getDual()
1.490 + + GraphToEps:
1.491 + * negateY() opt
1.492 + * male/female node shapes :)
1.493 + * correct %%BoundingBox handling
1.494 + Backward incompatibilities/changed namings:
1.495 + * Access functions of TimeStamp/Timer
1.496 + * Undir graph interface: findUEdge, ConUEdgeIt
1.497 + * pred -> predEdge renaming in search algorithms
1.498 + * SnapShot -> Snapshot in {List,Smart}Graph
1.499 + * NewEdgeSetAdaptor -> ListEdgeSet
1.500 + * LP: set{Obj,Row,Col}() -> {obj,row,col}()
1.501 + * "label" instead of "id" inside the LGF files
1.502 + * UndirGraph -> UGraph, UndirEdge* -> UEdge*
1.503 + * BipartiteGraph -> BpGraph, Lower/UpperNode* -> A/BNode*
1.504 + Bugfixes in
1.505 + * DFS
1.506 + * Preflow
1.507 + * x86_64 connected bugfixes (lemon_reader.h)
1.508 + * lp.h
1.509 + Other changes
1.510 + * Demos and benchmarks are not built by default now. They can be
1.511 + * enabled with the --enable-demo and --enable-benchmark
1.512 + * configure flags.
1.513 + * GCC 4.0.3 and ICC 9.0 compatibility
1.514 +
1.515 2005-08-27 Version 0.4 Released
1.516 - * List of new features and changes
1.517 - * Changed namings:
1.518 - Wrapper -> Adaptor
1.519 - kruskalEdgeMap() -> kruskal()
1.520 - kruskalEdgeMap_IteratorOut() -> kruskal()
1.521 - * BoundinBox<>
1.522 - * operator+=() -> add()
1.523 - + clear()
1.524 - + More and better graph I/O functionalities
1.525 - + High level uniform LP solver interface to CPLEX and GLKP
1.526 - * graphToEps()
1.527 - + Automatic node size and edge width scaling
1.528 - + Simple color palette tool (ColorSet)
1.529 - * Bfs/Dfs/Dijkstra
1.530 - + Step-by-step execution
1.531 - + Run from multiple sources
1.532 - + Used define stop condition
1.533 - + Improved "named parameters"
1.534 - * Preflow
1.535 - + Function type interface
1.536 - + Changed interface
1.537 - * ListGraph/SmarGraph
1.538 - + split() splits a node
1.539 - + SnapShot
1.540 - + New map adaptors
1.541 - + New convenience maps
1.542 - + IdMap, DescriptorMap
1.543 - + InDegMap, OutDegMap
1.544 - + XMap, YMap
1.545 - + Default graph maps are iterable
1.546 - + glemon: a graph editor
1.547 - + Some new demo codes added, the old ones got polished.
1.548 - * Better documentation
1.549 - * Several important bugfixes
1.550 - * Now lemon should compile without warnings with
1.551 - * gcc 3.3, 3.4, 4.0
1.552 - * Intel C++ Compiler v9.0
1.553 + New features
1.554 + + More and better graph I/O functionalities
1.555 + + High level uniform LP solver interface to CPLEX and GLKP
1.556 + + New map adaptors
1.557 + + New convenience maps
1.558 + * IdMap, DescriptorMap
1.559 + * InDegMap, OutDegMap
1.560 + * XMap, YMap
1.561 + + Default graph maps are iterable
1.562 + + glemon: a graph editor
1.563 + + Some new demo codes added, the old ones got polished.
1.564 + Improvements
1.565 + + graphToEps()
1.566 + * Automatic node size and edge width scaling
1.567 + * Simple color palette tool (ColorSet)
1.568 + + Bfs/Dfs/Dijkstra
1.569 + * Step-by-step execution
1.570 + * Run from multiple sources
1.571 + * Used define stop condition
1.572 + * Improved "named parameters"
1.573 + + Preflow
1.574 + * Function type interface
1.575 + * Changed interface
1.576 + + ListGraph/SmarGraph
1.577 + * split() splits a node
1.578 + * SnapShot
1.579 + Changes
1.580 + * Changed namings:
1.581 + * Wrapper -> Adaptor
1.582 + * kruskalEdgeMap() -> kruskal()
1.583 + * kruskalEdgeMap_IteratorOut() -> kruskal()
1.584 + * BoundingBox<>
1.585 + * operator+=() -> add()
1.586 + + clear()
1.587 + * Better documentation
1.588 + * Several important bugfixes
1.589 + * Now lemon should compile without warnings with
1.590 + * gcc 3.3, 3.4, 4.0
1.591 + * Intel C++ Compiler v9.0
1.592
1.593 2005-03-19 Version 0.3.1 Released
1.594 - * This release fixes a compilation failure bug under cygwin.
1.595 + This release fixes a compilation failure bug under cygwin.
1.596
1.597 2005-02-21 Version 0.3 released
1.598 - * List of new features and changes
1.599 - * Redesigned Graph infrastructures
1.600 - + Standardized LEMON exceptions
1.601 - + Undirected Graph
1.602 - + Standard graph file format, input and output classes for it.
1.603 - * head() -> target(), tail() -> source()
1.604 - * Some standard namings have changes:
1.605 - ValueType -> Value,
1.606 - KeyType -> Key,
1.607 - ReferenceType ->Reference,
1.608 - PointerType -> Pointer
1.609 - + GraphToEps: A simple graph drawer
1.610 - * Better documentation
1.611 -
1.612 +
1.613 + New features
1.614 + + Standardized LEMON exceptions
1.615 + + Undirected Graph
1.616 + + Standard graph file format, input and output classes for it.
1.617 + + GraphToEps: A simple graph drawer
1.618 + Changes
1.619 + * Redesigned Graph infrastructures
1.620 + * head() -> target(), tail() -> source()
1.621 + * Some standard namings have changes:
1.622 + ValueType -> Value,
1.623 + KeyType -> Key,
1.624 + ReferenceType ->Reference,
1.625 + PointerType -> Pointer
1.626 + * Better documentation
1.627 +
1.628 2004-09-30 Version 0.2 released
1.629 -