alpar@665: 2009-05-13 Version 1.1 released alpar@665: alpar@665: This is the second stable release of the 1.x series. It alpar@665: features a better coverage of the tools available in the 0.x alpar@665: series, a thoroughly reworked LP/MIP interface plus various alpar@665: improvements in the existing tools. alpar@665: alpar@665: * Much improved M$ Windows support alpar@665: * Various improvements in the CMAKE build system alpar@665: * Compilation warnings are fixed/suppressed alpar@665: * Support IBM xlC compiler alpar@665: * New algorithms alpar@665: * Connectivity related algorithms (#61) alpar@665: * Euler walks (#65) alpar@665: * Preflow push-relabel max. flow algorithm (#176) alpar@665: * Circulation algorithm (push-relabel based) (#175) alpar@665: * Suurballe algorithm (#47) alpar@665: * Gomory-Hu algorithm (#66) alpar@665: * Hao-Orlin algorithm (#58) alpar@665: * Edmond's maximum cardinality and weighted matching algorithms alpar@665: in general graphs (#48,#265) alpar@665: * Minimum cost arborescence/branching (#60) alpar@665: * Network Simplex min. cost flow algorithm (#234) alpar@665: * New data structures alpar@665: * Full graph structure (#57) alpar@665: * Grid graph structure (#57) alpar@665: * Hypercube graph structure (#57) alpar@665: * Graph adaptors (#67) alpar@665: * ArcSet and EdgeSet classes (#67) alpar@665: * Elevator class (#174) alpar@665: * Other new tools alpar@665: * LP/MIP interface (#44) alpar@665: * Support for GLPK, CPLEX, Soplex, COIN-OR CLP and CBC alpar@665: * Reader for the Nauty file format (#55) alpar@665: * DIMACS readers (#167) alpar@665: * Radix sort algorithms (#72) alpar@665: * RangeIdMap and CrossRefMap (#160) alpar@665: * New command line tools alpar@665: * DIMACS to LGF converter (#182) alpar@665: * lgf-gen - a graph generator (#45) alpar@665: * DIMACS solver utility (#226) alpar@665: * Other code improvements alpar@665: * Lognormal distribution added to Random (#102) alpar@665: * Better (i.e. O(1) time) item counting in SmartGraph (#3) alpar@665: * The standard maps of graphs are guaranteed to be alpar@665: reference maps (#190) alpar@665: * Miscellaneous alpar@665: * Various doc improvements alpar@665: * Improved 0.x -> 1.x converter script alpar@665: alpar@665: * Several bugfixes (compared to release 1.0): alpar@665: #170: Bugfix SmartDigraph::split() alpar@665: #171: Bugfix in SmartGraph::restoreSnapshot() alpar@665: #172: Extended test cases for graphs and digraphs alpar@665: #173: Bugfix in Random alpar@665: * operator()s always return a double now alpar@665: * the faulty real(Num) and real(Num,Num) alpar@665: have been removed alpar@665: #187: Remove DijkstraWidestPathOperationTraits alpar@665: #61: Bugfix in DfsVisit alpar@665: #193: Bugfix in GraphReader::skipSection() alpar@665: #195: Bugfix in ConEdgeIt() alpar@665: #197: Bugfix in heap unionfind alpar@665: * This bug affects Edmond's general matching algorithms alpar@665: #207: Fix 'make install' without 'make html' using CMAKE alpar@665: #208: Suppress or fix VS2008 compilation warnings alpar@665: ----: Update the LEMON icon alpar@665: ----: Enable the component-based installer alpar@665: (in installers made by CPACK) alpar@665: ----: Set the proper version for CMAKE in the tarballs alpar@665: (made by autotools) alpar@665: ----: Minor clarification in the LICENSE file alpar@665: ----: Add missing unistd.h include to time_measure.h alpar@665: #204: Compilation bug fixed in graph_to_eps.h with VS2005 alpar@665: #214,#215: windows.h should never be included by lemon headers alpar@665: #230: Build systems check the availability of 'long long' type alpar@665: #229: Default implementation of Tolerance<> is used for integer types alpar@665: #211,#212: Various fixes for compiling on AIX alpar@665: ----: Improvements in CMAKE config alpar@665: - docs is installed in share/doc/ alpar@665: - detects newer versions of Ghostscript alpar@665: #239: Fix missing 'inline' specifier in time_measure.h alpar@665: #274,#280: Install lemon/config.h alpar@665: #275: Prefix macro names with LEMON_ in lemon/config.h alpar@665: ----: Small script for making the release tarballs added alpar@665: ----: Minor improvement in unify-sources.sh (a76f55d7d397) alpar@665: alpar@507: 2009-03-27 LEMON joins to the COIN-OR initiative alpar@507: alpar@507: COIN-OR (Computational Infrastructure for Operations Research, alpar@507: http://www.coin-or.org) project is an initiative to spur the alpar@507: development of open-source software for the operations research alpar@507: community. alpar@507: alpar@322: 2008-10-13 Version 1.0 released alpar@262: alpar@262: This is the first stable release of LEMON. Compared to the 0.x alpar@262: release series, it features a considerably smaller but more alpar@262: matured set of tools. The API has also completely revised and alpar@262: changed in several places. alpar@262: alpar@322: * The major name changes compared to the 0.x series (see the alpar@322: Migration Guide in the doc for more details) alpar@262: * Graph -> Digraph, UGraph -> Graph alpar@262: * Edge -> Arc, UEdge -> Edge alpar@262: * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge) alpar@262: * Other improvements alpar@262: * Better documentation alpar@262: * Reviewed and cleaned up codebase alpar@262: * CMake based build system (along with the autotools based one) alpar@262: * Contents of the library (ported from 0.x) alpar@262: * Algorithms alpar@262: * breadth-first search (bfs.h) alpar@262: * depth-first search (dfs.h) alpar@262: * Dijkstra's algorithm (dijkstra.h) alpar@262: * Kruskal's algorithm (kruskal.h) alpar@262: * Data structures alpar@262: * graph data structures (list_graph.h, smart_graph.h) alpar@262: * path data structures (path.h) alpar@262: * binary heap data structure (bin_heap.h) alpar@262: * union-find data structures (unionfind.h) alpar@262: * miscellaneous property maps (maps.h) alpar@262: * two dimensional vector and bounding box (dim2.h) alpar@262: * Concepts alpar@262: * graph structure concepts (concepts/digraph.h, concepts/graph.h, alpar@262: concepts/graph_components.h) alpar@262: * concepts for other structures (concepts/heap.h, concepts/maps.h, alpar@262: concepts/path.h) alpar@262: * Tools alpar@262: * Mersenne twister random number generator (random.h) alpar@262: * tools for measuring cpu and wall clock time (time_measure.h) alpar@262: * tools for counting steps and events (counter.h) alpar@262: * tool for parsing command line arguments (arg_parser.h) alpar@262: * tool for visualizing graphs (graph_to_eps.h) alpar@262: * tools for reading and writing data in LEMON Graph Format alpar@262: (lgf_reader.h, lgf_writer.h) alpar@262: * tools to handle the anomalies of calculations with alpar@262: floating point numbers (tolerance.h) alpar@262: * tools to manage RGB colors (color.h) alpar@262: * Infrastructure alpar@262: * extended assertion handling (assert.h) alpar@262: * exception classes and error handling (error.h) alpar@262: * concept checking (concept_check.h) alpar@262: * commonly used mathematical constants (math.h)