alpar@1080: 2011-08-08 Version 1.1.4 released alpar@1080: alpar@1080: Bugfix release. alpar@1080: alpar@1080: #392: Bug fix in Dfs::start(s,t) alpar@1080: #414: Fix wrong initialization in Preflow alpar@1080: #404: Update Doxygen configuration alpar@1080: #416: Support tests with valgrind alpar@1080: #418: Better Win CodeBlock/MinGW support alpar@1080: #419: Backport build environment improvements from the main branch alpar@1080: - Build of mip_test and lp_test precede the running of the tests alpar@1080: - Also search for coin libs under ${COIN_ROOT_DIR}/lib/coin alpar@1080: - Do not look for COIN_VOL libraries alpar@1080: #382: Allow lgf file without Arc maps alpar@1080: alpar@1003: 2010-10-21 Version 1.1.3 released alpar@1003: alpar@1003: Bugfix release. alpar@1003: alpar@1003: #366: Fix Pred[Matrix]MapPath::empty() alpar@1003: #371: Bug fix in (di)graphCopy() alpar@1003: The target graph is cleared before adding nodes and arcs/edges. alpar@1003: alpar@1003: #356: Fix multiple execution bug in weighted matchings alpar@1003: #364: Add missing UndirectedTags alpar@1003: #368: Fix the usage of std::numeric_limits<>::min() in Network Simplex alpar@1003: #372: Fix a critical bug in preflow alpar@1003: alpar@939: 2010-03-08 Version 1.1.2 released alpar@939: alpar@939: Bugfix release. alpar@939: alpar@939: #317: Fix (and improve) error message in mip_test.cc alpar@939: Remove unnecessary OsiCbc dependency alpar@939: #250: Fix in pathSource() and pathTarget() alpar@939: #322: Distribute LEMONConfig.cmake.in alpar@939: #321: Use pathCopy(from,to) instead of copyPath(to,from) alpar@939: #330: Bug fix in map_extender.h alpar@939: #335: Fix clear() function in ExtendFindEnum alpar@939: #337: Use void* as LPX object pointer alpar@939: #336: Fix the date field comment of graphToEps() output alpar@939: #323: Bug fix in Suurballe alpar@939: alpar@853: 2009-10-03 Version 1.1.1 released alpar@853: alpar@853: Bugfix release. alpar@853: alpar@853: #295: Suppress MSVC warnings using pragmas alpar@853: ----: Various CMAKE related improvements alpar@853: * Remove duplications from doc/CMakeLists.txt alpar@853: * Rename documentation install folder from 'docs' to 'html' alpar@853: * Add tools/CMakeLists.txt to the tarball alpar@853: * Generate and install LEMONConfig.cmake alpar@853: * Change the label of the html project in Visual Studio alpar@853: * Fix the check for the 'long long' type alpar@853: * Put the version string into config.h alpar@853: * Minor CMake improvements alpar@853: * Set the version to 'hg-tip' if everything fails alpar@853: #311: Add missing 'explicit' keywords alpar@853: #302: Fix the implementation and doc of CrossRefMap alpar@853: #308: Remove duplicate list_graph.h entry from source list alpar@853: #307: Bug fix in Preflow and Circulation alpar@853: alpar@712: 2009-05-13 Version 1.1 released alpar@712: alpar@712: This is the second stable release of the 1.x series. It alpar@712: features a better coverage of the tools available in the 0.x alpar@712: series, a thoroughly reworked LP/MIP interface plus various alpar@712: improvements in the existing tools. alpar@712: alpar@712: * Much improved M$ Windows support alpar@712: * Various improvements in the CMAKE build system alpar@712: * Compilation warnings are fixed/suppressed alpar@712: * Support IBM xlC compiler alpar@712: * New algorithms alpar@712: * Connectivity related algorithms (#61) alpar@712: * Euler walks (#65) alpar@712: * Preflow push-relabel max. flow algorithm (#176) alpar@712: * Circulation algorithm (push-relabel based) (#175) alpar@712: * Suurballe algorithm (#47) alpar@712: * Gomory-Hu algorithm (#66) alpar@712: * Hao-Orlin algorithm (#58) alpar@712: * Edmond's maximum cardinality and weighted matching algorithms alpar@712: in general graphs (#48,#265) alpar@712: * Minimum cost arborescence/branching (#60) alpar@712: * Network Simplex min. cost flow algorithm (#234) alpar@712: * New data structures alpar@712: * Full graph structure (#57) alpar@712: * Grid graph structure (#57) alpar@712: * Hypercube graph structure (#57) alpar@712: * Graph adaptors (#67) alpar@712: * ArcSet and EdgeSet classes (#67) alpar@712: * Elevator class (#174) alpar@712: * Other new tools alpar@712: * LP/MIP interface (#44) alpar@712: * Support for GLPK, CPLEX, Soplex, COIN-OR CLP and CBC alpar@712: * Reader for the Nauty file format (#55) alpar@712: * DIMACS readers (#167) alpar@712: * Radix sort algorithms (#72) alpar@712: * RangeIdMap and CrossRefMap (#160) alpar@712: * New command line tools alpar@712: * DIMACS to LGF converter (#182) alpar@712: * lgf-gen - a graph generator (#45) alpar@712: * DIMACS solver utility (#226) alpar@712: * Other code improvements alpar@712: * Lognormal distribution added to Random (#102) alpar@712: * Better (i.e. O(1) time) item counting in SmartGraph (#3) alpar@712: * The standard maps of graphs are guaranteed to be alpar@712: reference maps (#190) alpar@712: * Miscellaneous alpar@712: * Various doc improvements alpar@712: * Improved 0.x -> 1.x converter script alpar@712: alpar@712: * Several bugfixes (compared to release 1.0): alpar@712: #170: Bugfix SmartDigraph::split() alpar@712: #171: Bugfix in SmartGraph::restoreSnapshot() alpar@712: #172: Extended test cases for graphs and digraphs alpar@712: #173: Bugfix in Random alpar@712: * operator()s always return a double now alpar@712: * the faulty real(Num) and real(Num,Num) alpar@712: have been removed alpar@712: #187: Remove DijkstraWidestPathOperationTraits alpar@712: #61: Bugfix in DfsVisit alpar@712: #193: Bugfix in GraphReader::skipSection() alpar@712: #195: Bugfix in ConEdgeIt() alpar@712: #197: Bugfix in heap unionfind alpar@712: * This bug affects Edmond's general matching algorithms alpar@712: #207: Fix 'make install' without 'make html' using CMAKE alpar@712: #208: Suppress or fix VS2008 compilation warnings alpar@712: ----: Update the LEMON icon alpar@712: ----: Enable the component-based installer alpar@712: (in installers made by CPACK) alpar@712: ----: Set the proper version for CMAKE in the tarballs alpar@712: (made by autotools) alpar@712: ----: Minor clarification in the LICENSE file alpar@712: ----: Add missing unistd.h include to time_measure.h alpar@712: #204: Compilation bug fixed in graph_to_eps.h with VS2005 alpar@712: #214,#215: windows.h should never be included by lemon headers alpar@712: #230: Build systems check the availability of 'long long' type alpar@712: #229: Default implementation of Tolerance<> is used for integer types alpar@712: #211,#212: Various fixes for compiling on AIX alpar@712: ----: Improvements in CMAKE config alpar@712: - docs is installed in share/doc/ alpar@712: - detects newer versions of Ghostscript alpar@712: #239: Fix missing 'inline' specifier in time_measure.h alpar@712: #274,#280: Install lemon/config.h alpar@712: #275: Prefix macro names with LEMON_ in lemon/config.h alpar@712: ----: Small script for making the release tarballs added alpar@712: ----: Minor improvement in unify-sources.sh (a76f55d7d397) alpar@712: alpar@534: 2009-03-27 LEMON joins to the COIN-OR initiative alpar@534: alpar@534: COIN-OR (Computational Infrastructure for Operations Research, alpar@534: http://www.coin-or.org) project is an initiative to spur the alpar@534: development of open-source software for the operations research alpar@534: community. alpar@534: 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)