Merge fix #470

Suppress 'unused local typedefs' warnings, and resolve others (#470)

Bugfix in test/maps_test.cc (#469)

Fix #define indicating CPLEX availability (#446)

Merge #446, #457, #465

Enable/disable options for LP/MIP backends (#465)

Add file export funcionality to LpBase (#457)

Better CPLEX discovery (#446)

Avoid usage of alternative operator (#177)

Merge test files of Preflow and EdmondsKarp (#177)

Rename flow init functions according to Preflow (#177)

Rename DefFlowMap named parameter to SetFlowMap (#177)
in EdmondsKarp according to Preflow

Improve and fix API doc of EdmondsKarp according to Preflow (#177)

Port Edmonds-Karp algorithm from svn -r3524 (#177)

Merge #442

New features in time_measure.h (#442)

Use doxygen's own bibtex support (#456)

Adjust the formatting of bib2dox.py to Doxygen 1.8.x (#459)

Add references to papers related to LEMON (#459)

Add images to the doc of two groups (#459)

Minor fixes and improvements in the doc (#459)

Merge #411

Merge

Adjust image sizes in the documentation (#411)

Improve images of the Connectivity section (#411)

Greatly extend path_test.cc + fix compiler warning (#408)

More tests for radixSort() (#362)

Bidirectional iterator support for radixSort() (#362)

Merge #455

Use MathJax for rendering the math formulae (#455)

Fix 'make update-external-tags' behavior (#455)

Merge #386

Use output iterator instead of a container (#386)
in tourNodes() functions of TSP algorithms

Make InsertionTsp much faster and improve docs (#386)

A detailed test file for TSP algorithms (#386)

Unifications and improvements in TSP algorithms (#386)

Document and greatly improve TSP algorithms (#386)

- Add LEMON headers.
- Add Doxygen doc for all classes and their members.
- Clarify and unify the public API of the algorithms.
- Various small improvements in the implementations to make
them clearer and faster.
- Avoid using adaptors in ChristofidesTsp.

Doc group for TSP algorithms (#386)

Heuristic algorithms for symmetric TSP (#386)

Changes in BpGraph lgf reader and writer (#69)
- Add typesade RedNode and BlueNode reading and writing
- RedNodes and BlueNodes don't need to have distinct label set
- Add tests

Update LGF reader to work with typesafe bipartite node sets (#69)

Doc fix in BpGraphs (#69)

Remove asRedBludeNode() function (#69)

Renamings in BpGraphs (#69)
- RedIt->RedNodeIt
- BlueIt->BlueNodeIt
- RedMap->RedNodeMap
- BlueMap->BlueNodeMap

Type safe red and blue node set (#69)

LGF reader and writer for bipartite graphs (#69)

Use member variables to store the highest IDs in bipartite partitions (#69)

Implementation of BpGraphCopy (#69)

ListBpGraph implementation (#69)

FullBpGraph implementation (#69)

SmartBpGraph implementation (#69)

Add bipartite graph concepts (#69)

Better Maintainer build type settings (for MSVC)

Merge bugfix #445

Fix missing initialization in CplexEnv::CplexEnv() (#445)

Merge #438 and #436

Ensure strongly polynomial running time for CycleCanceling (#436)
The number of iterations performed by Howard's algorithm is limited.
If the limit is reached, a strongly polynomial implementation,
HartmannOrlinMmc is executed to find a minimum mean cycle.
This iteration limit is typically not reached, thus the combined
method is practically equivalent to Howard's algorithm, while it
also ensures the strongly polynomial time bound.

Optional iteration limit in HowardMmc (#438)

Further GCC 4.7 compiler warning fix (#453)

Merge bugfix #453

Further GCC 4.7 compiler warning fixes (#453)

Merge #453 to branches >=1.2

Avoid GCC 4.7 compiler warnings (#453)

Merge bugfix #440

Fix a bug + remove redundant typedefs in dimacs-solver (#440)

Merge docfix #437

Doc improvements for min cost flow algorithms (#437)

Improve module docs and references (#437)

Further clang compilation fixes (#449)

Merge #449

Further clang compilation fixes (#449)

Merge #449 to branches >=1.2

Fix clang compilation warnings and errors (#449)

Merge bugfix #448

Bugfix in adaptor_test.cc (#448)

Merge bugfix #447

Bugfix in AllArcLookUp<> (#447)

Update INSTALL to use CMAKE. Also update AUTHORS and LICENSE

Merge bugfix #444

Bugfix in path copy constructors and assignment operators (#444)

Merge bugfix #441

Fix buggy reinitialization in _solver_bits::VarIndex::clear() (#441)

- In addition, rows.clear() and cols.clear() are moved up to LpBase::clear()

Merge

Merge

Fix the doc in CapacityScaling: cost can be real numbers (#261)

Improve the Altering List pivot rule for NetworkSimplex (#435)
Much less candidate arcs are preserved from an iteration to the
next one and partial_sort() is used instead of heap operations.

Add dist target to CMAKE conf. (#434)

Use hg templating instead of scripts/chg-len.py (#434)

Remove autotool related files (#434)

LEMON_THREADING cmake variable for choosing threading lib (#223)

Thread safe map construction and destruction (#223)

It currently support pthread and windows threads.

GCC 3.3 compatibility fix in nagamochi_ibaraki.h

Intel C++ compatibility fix in max_cardinality_search.h

Merge Intel C++ compatibility fixes

Intel C++ compatibility fixes

Merge LP interface updates

Make CBC interface compatible with latest CBC releases

CBC now uses the CLP backend unconditionally

Update CPLEX lookup

- References to explicit CPLEX version 9.1 have been removed
- Library file name must either be 'cplex.a' or 'cplex.dll'

Merge #432 and #433

Add missing doc/references.bib to release tarball (#432)

Merge

Support shared library build (#433)

Add missing doc/template.h to release tarball (#432)

Merge head merging

Merge

Merge

Merge

Merge

Merge

Merge

Merge

Merge bugfix #430

Fix LpBase::Constr two-side limit bug (#430)

Merge #428 and #429

Fix windows-specific compilation error (#429)

Fix VS warnings (#429)

Add lemon/lemon.pc.cmake to the release tarball (#428)

Merge AUTHORS file update

Update the AUTHORS file

Merge #382

Allow lgf file without Arc maps (#382)

A single '-' character in the @arcs sectio header indicates that
there is no arc map.

Merge #419

Do not look for COIN_VOL libraries

Also search for coin libs under ${COIN_ROOT_DIR}/lib/coin (#419)

Build of mip_test and lp_test precede the running of the tests (#419)

Merge GLPK fix #337 with CMAKE improvements

Merge bugfix #420

Fix IterableValueMap (#420)

Merge #418

Better Win CodeBlock/MinGW support (#418)
- Remove -ansi compilation flag
- Don't include sys/times.h when WIN32 is defined

Merge #416

Change the default scaling factor in CostScaling (#417)

Faster computation of the dual solution in CostScaling (#417)

Implement the scaling Price Refinement heuristic in CostScaling (#417)
instead of Early Termination.

These two heuristics are similar, but the newer one is faster
and not only makes it possible to skip some epsilon phases, but
it can improve the performance of the other phases, as well.

Fix and improve refine methods in CostScaling (#417)

Minor improvements in CostScaling (#417)

Support tests with valgrind (#416)

Merge #417

Bug fix in CostScaling (#417)

Merge #404

Remove doc header (show version number on the main page) (#404)

Update Doxygen config files + enable search (#404)

Backport the CMAKE related changesets from the main branch

[e20fecd1945f] Add check target for CMake (#388)
[e74b5db4f2c6] Put the output of chg-len.py in the version string (#389)
[7d166b8b8018] Safer call of ./scripts/chg-len.py on Windows (#389)
[659ba4805a48] Make CMAKE config more consistent with configure.ac (#390)
[63e4468c680e] Add 'Maintainer' CMAKE build type (#388, #390)
[a725503acfe9] Allow CPACK configuration on all platforms
[10242c611190] Create and install lemon.pc (#393)
[48e29534cf03] The deafult target doesn't build lp_test and mip_test (#388)
[0fbbdd578c06] Full path for DoxygenLayout.xml in Doxyfile.in (#395)
[481496e6d71f] SOURCE_BROWSER Doxygen switch is configurable from CMAKE (#395)
[09282720100b] update-external-tags CMAKE target (#395)

Backport [53bea38f71cb] 'Update Doxygen configuration file'

Add contrib dir (#401)

Merge bugfix #414

Fix wrong initialization in Preflow (#414)

Merge

Minor doc improvements

Improve the doc of path structures (#406)

Various doc improvements (#406)

Various search limits for the max clique alg (#405)

Merge

Port max. card. search alg. from svn -r3512 (#397) and (#56)

Doc improvements in HaoOrlin (#398)

Merge

New implementation for Nagamochi-Ibaraki algorithm

update-external-tags CMAKE target (#395)

SOURCE_BROWSER Doxygen switch is configurable from CMAKE (#395)

Full path for DoxygenLayout.xml in Doxyfile.in (#395)

The deafult target doesn't build lp_test and mip_test (#388)

Create and install lemon.pc (#393)

Merge bugfix #392

Bug fix in Dfs::start(s,t) (#392)

Merge #380

Add a heuristic algorithm for the max clique problem (#380)

Merge CMAKE config improvements (#388, #389, #390)

Allow CPACK configuration on all platforms

Add 'Maintainer' CMAKE build type (#388, #390)

- some extra warning and debug options
- build stops on warning (-Werror)
- tests are built and run by default

Make CMAKE config more consistent with configure.ac (#390)

- CMAKE_BUILD_TYPE is Release by deafult
- The same set of warnings are used when compiling with gcc

Safer call of ./scripts/chg-len.py on Windows (#389)

Still hard to get it worked properly by user. It needs
- a python interpreter in the exec path
- the mercurial modules accessible by this interpreter

Put the output of chg-len.py in the version string (#389)

Add check target for CMake (#388)

Improve arc mixing in NS and enable it by default (#391)

Improve the tree update process and a pivot rule (#391)
and make some parts of the code clearer using better names

Improve graph_copy_test.cc

Merge bugfix #371

Merge bugfix #372

Fix critical bug in preflow (#372)

The wrong transition between the bound decrease and highest active
heuristics caused the bug. The last node chosen in bound decrease mode
is used in the first iteration in highest active mode.

Bug fix in (di)graphCopy() (#371)

The target graph is cleared before adding nodes and arcs/edges.

Merge bugfix #368

Fix the usage of min() (#368)

Merge bugfix #366

Fix PredMatrixMapPath::empty() (#366)

Fix PredMapPath::empty() (#366)

Merge bugfix #364

Add an undirected() function (#364)

Add missing UndirectedTags (#364)

Update NEWS file

Merge backout of a6eb9698c321 (#360,#51)

Small doc fixes and improvements (#359)

Backed out changeset a6eb9698c321 (#360, #51)

Unify the sources (#339)

Fix multiple executions in matchings (fract. mathcings) (#356)

Merge #356

Merge #314

Minor doc fix related to #348

Uniforming primal scale to 2 (#314)

Fix documentation issues (#314)

Fractional matching initialization of weighted matchings (#314)

Add fractional matching algorithms (#314)

General improvements in weighted matching algorithms (#314)

- Fix include guard
- Uniform handling of MATCHED and UNMATCHED blossoms
- Prefer operations which decrease the number of trees
- Fix improper use of '/='

The solved problems did not cause wrong solution.

Fix multiple execution bug in weighted matchings (#356)

This chgset also redoes the fix of [28c7ad6f8d91] and its backpont to 1.1,
[268a052c3043].

Add doc/references.dox to .hgignore

Replace figure at matching doc #348

The original bibartite_matching.eps is kept for future use.

Rename min mean cycle classes and their members (#179)
with respect to the possible introduction of min ratio
cycle algorithms in the future.

The renamed classes:
- Karp --> KarpMmc
- HartmannOrlin --> HartmannOrlinMmc
- Howard --> HowardMmc

The renamed members:
- cycleLength() --> cycleCost()
- cycleArcNum() --> cycleSize()
- findMinMean() --> findCycleMean()
- Value --> Cost
- LargeValue --> LargeCost
- SetLargeValue --> SetLargeCost

Fix gcc 3.3 compilation error (#354)

gcc 3.3 requires that a class has a default constructor if it has
template named parameters. (That constructor can be protected.)

Clarify type names in NetworkSimplex (#353)

This patch clarifies the misleading effects of the renamings
in [f3bc4e9b5f3a].

Merge #306

Add tolerance() functions for HaoOrlin (#306)

Merge #301

Also test fullInit() in suurballe_test (#181, #323)

Add traits class + named parameters to Suurballe (#323)

The following types can be modified using named parameters:
- FlowMap
- PotentialMap
- Path
- Heap + HeapCrossRef

Merge #181, #323

Rename heap structures (#301)

- KaryHeap --> DHeap
- FouraryHeap --> QuadHeap
- BinomHeap --> BinomialHeap

Add a fullInit() function to Suurballe (#181, #323)
to provide faster handling of multiple targets.
A start() function is also added, just for the sake of
convenience.

Rework and improve Suurballe (#323)

- Improve the implementation: use a specific, faster variant of
residual Dijkstra for the first search.
- Some reorganizatiopn to make the code simpler.
- Small doc improvements.

Remove unnecessary integer requirement in Suurballe (#323)

Bug fix in Suurballe (#323)

Configurable glpk prefix in ./scripts/bootstrap.sh and ...
unneeded solver backends are explicitely switched off with --without-*

Merge #342

Improve README and mainpage.dox (#342)

Merge #347

Use 'long long' flow cost in dimacs-solver.cc (#347)

Merge

Support tolerance technique for BellmanFord (#51)

A new operation traits class BellmanFordToleranceOperationTraits
is introduced, which uses the tolerance technique in its less()
function. This class can be used with the SetOperationTraits
named template parameter.

Merge #332

ArgParser can throw exception instead of exit(1) (#332)

Better return type for cycleLength() functions (#179)
in the min mean cycle algorithms.

The original Value type is used instead of the LargeValue type,
which is introduced for internal computations.

Merge #340

New heuristics for MCF algorithms (#340)
and some implementation improvements.

- A useful heuristic is added to NetworkSimplex to make the
initial pivots faster.
- A powerful global update heuristic is added to CostScaling
and the implementation is reworked with various improvements.
- Better relabeling in CostScaling to improve numerical stability
and make the code faster.
- A small improvement is made in CapacityScaling for better
delta computation.
- Add notes to the classes about the usage of vector<char> instead
of vector<bool> for efficiency reasons.

Merge bugfix #336

Fix the date field comment of graphToEps() output (#336)

Modify the header of scripts/bib2dox.py (#184)

Merge

Fix LpBase::addRow(Constr) (#334)

Merge bugfix #337

Use void* like LPX object (#337)

Merge

Handle graph changes in the MCF algorithms (#327)

The reset() functions are renamed to resetParams() and the new reset()
functions handle the graph chnages, as well.

Merge

Doc improvements for planarity related tools (#62)

Port planar image from SVN -r3524 (#62)

Merge

Add doc for the traits class parameters (#315)

Add more information on Makefile variables (#316)

Add a warning about huge capacities in Preflow (#319)

Merge #180 and a bugfix in #51

Small bug fixes (#180)

Rename a private type in MCF classes (#180)

The new MCF algorithms define a private map type VectorMap,
which could be misleading, since there is an other VectorMap
defined in lemon/bits/vector_map.h. Thus the new type is
is renamed to StaticVectorMap.

Adds tests for the new MCF algorithms (#180)

Rework the MCF test file to help extending it (#180)

Fixes in the heap concept to avoid warnings (#180)

Add citations to CycleCanceling (#180, #184)

Entirely rework cycle canceling algorithms (#180)

- Move the cycle canceling algorithms (CycleCanceling, CancelAndTighten)
into one class (CycleCanceling).
- Add a Method parameter to the run() function to be able to select
the used cycle canceling method.
- Use the new interface similarly to NetworkSimplex.
- Rework the implementations using an efficient internal structure
for handling the residual network.
This improvement made the codes much faster.
- Handle GEQ supply type (LEQ is not supported).
- Handle infinite upper bounds.
- Handle negative costs (for arcs of finite upper bound).
- Extend the documentation.

Port cycle canceling algorithms from SVN -r3524 (#180)

Add citations to the scaling MCF algorithms (#180, #184)
and improve the doc of their group.

Small doc improvements + unifications in MCF classes (#180)

Small implementation improvements in MCF algorithms (#180)

- Handle max() as infinite value (not only infinity()).
- Better GEQ handling in CapacityScaling.
- Skip the unnecessary saturating operations in the first phase in
CapacityScaling.
- Use vector<char> instead of vector<bool> and vector<int> if it is
possible and it proved to be usually faster.

More options for run() in scaling MCF algorithms (#180)

- Three methods can be selected and the scaling factor can be
given for CostScaling.
- The scaling factor can be given for CapacityScaling.

Entirely rework CostScaling (#180)

- Use the new interface similarly to NetworkSimplex.
- Rework the implementation using an efficient internal structure
for handling the residual network. This improvement made the
code much faster.
- Handle GEQ supply type (LEQ is not supported).
- Handle infinite upper bounds.
- Handle negative costs (for arcs of finite upper bound).
- Traits class + named parameter for the LargeCost type used in
internal computations.
- Extend the documentation.

Port CostScaling from SVN -r3524 (#180)

Traits class + a named parameter for CapacityScaling (#180)
to specify the heap used in internal Dijkstra computations.

Entirely rework CapacityScaling (#180)

- Use the new interface similarly to NetworkSimplex.
- Rework the implementation using an efficient internal structure
for handling the residual network. This improvement made the
code much faster (up to 2-5 times faster on large graphs).
- Handle GEQ supply type (LEQ is not supported).
- Handle negative costs for arcs of finite capacity.
(Note that this algorithm cannot handle arcs of negative cost
and infinite upper bound, thus it returns UNBOUNDED if such
an arc exists.)
- Extend the documentation.

Port CapacityScaling from SVN -r3524 (#180)

Memory leak bugfix in BellmanFord (#51)

Merge bugfix #330

Merge

Bug fix in map_extender.h (#330)

Fix clear() function in ExtendFindEnum (#335)

Merge #62

Planarity checking function instead of class (#62)

Port planarity related algorithms from SVN 3509 (#62)

Merge

Fix in HartmannOrlin algorithm (#333)

Valgring option for ./scripts/bootstrap.sh

Optionally use valgrind when running tests + other build system fixes

Merge

Merge

Fix gcc-4.4 compilation warning

Map utility functions (#320)

Merge

Various doc improvements (#331)

- Add notes to the graph classes about the time of
item counting.
- Clarify the doc for run() in BFS and DFS.
- Other improvements.

Small doc fixes in several files (#331)

Doc improvements for Path and PathDumper concepts (#331)

Merge #321

Merge #293

Merge

Small fixes related to BellmanFord (#51)

- Add a missing #include.
- Add a missing const keyword for negativeCycle().
- Test if negativeCycle() is const function.

Merge #68 (Port static graph implementation)

Merge

Make some graph member functions static (#311, #68)

Add a new build() function to StaticDigraph (#68)

This function builds the digraph from an arc list that
contains pairs of integer indices from the range [0..n-1].
It is useful in the cases when you would like to build a
StaticDigraph from scratch, i.e. you do not want to build
another digraph that can be copied using the other build()
function.

Extend the interface of StaticDigraph (#68)
with index(), arc() and node() functions similarly to
other static graph structures.

Add documentation for StaticDigraph (#68)

Small improvements + add tests for StaticDigraph (#68)

Port StaticDigraph from SVN -r3524 (#68)

Small fix in the doc (#179)

Add citations to the min mean cycle classes (#179, #184)

Merge #179 (Port the min mean cycle algorithms)

Add tolerance() functions for MMC classes (#179)

Separate group for the min mean cycle classes (#179)

Simplify comparisons in min mean cycle classes (#179)
using extreme INF values instead of bool flags.

Add HartmannOrlin algorithm class (#179)
This algorithm is an improved version of Karp's original method,
it applies an efficient early termination scheme.
The interface is the same as Karp's and Howard's interface.

Add Karp algorithm class (#179)
based on the MinMeanCycle implementation in SVN -r3436.
The interface is reworked to be the same as Howard's interface.

Rename MinMeanCycle to Howard (#179)

Add a detailed test file for MinMeanCycle and fix test_tools.h (#179)

Rename cyclePath() to cycle() in MinMeanCycle (#179)

Traits class + named parameters for MinMeanCycle (#179)

- Add a Traits class defining LargeValue, Tolerance, Path types.
LargeValue is used for internal computations, it is 'long long'
if the length type is integer, otherwise it is 'double'.
- Add named template parameters for LargeValue and Path types.
- Improve numerical stability: remove divisions from the internal
computations. If the arc lengths are integers, then all used
values are integers (except for the cycleMean() query function,
of course).

Rework and fix the implementation of MinMeanCycle (#179)

- Fix the handling of the cycle means.
- Many implementation improvements:
- More efficient data storage for the strongly connected
components.
- Better handling of BFS queues.
- Merge consecutive BFS searches (perform two BFS searches
instead of three).

This version is about two times faster on average and an order of
magnitude faster if there are a lot of strongly connected components.

Simplify the interface of MinMeanCycle (#179)
Remove init() and reset(), and move their content into findMinMean().

Port MinMeanCycle from SVN -r3524 (#179)
with some doc improvements

Merge #184

Update Doxygen configuration file

Insert citations into the doc (#184)

- Add general citations to modules.
- Add specific citations for max flow and min cost flow algorithms.
- Add citations for the supported LP and MIP solvers.
- Extend the main page.
- Replace inproceedings entries with the journal versions.
- Add a new bibtex entry about network simplex.
- Remove unwanted entries.

Handle url fields in bib2dox.py (#184)
and modify the bibtex file using url fields.

Merge bugfix #322

Distribute LEMONConfig.cmake.in (#322)

Merge bugfix in #250

Merge #317

Remove unnecessary OsiCbc dependency (#317)

Fix (and improve) error message in mip_test.cc (#317)

Add soplex support to scripts/bootstrap.sh plus...
it checks whether cbc and soplex are installed at the given prefix.

Faster add row operation (#203)

One virtual function call instead of more

Improve bib2dox.py using \section for entiries (#184)

Integrate bib2dox.py into the build environments (#184)

Add bib->dox converter and initial references.bib (#184)

Merge #311

Merge

Add a warning for List(Di)Graph::Snapshot (#311)
and extend tests for snapshots

Modify the implementation of ListDigraph::ArcIt (#311)

The new implementation is based on out-arc iteration (like
ListGraph::ArcIt) instead of in-arc iteration to make it
consistent with the documentation.

Much better implementation for node splitting (#311)
in ListDigraph. This solution is the same as the one that
is used in SmartDigraph. It is much faster and does not
invalidate any iterator like the former implementation.

Add a resize() function to HypercubeGraph (#311)
just like the similar functions in other static graph structures,
and extend the test files to check these functions.

Add reserve functions to ListGraph and SmartGraph (#311)
ListDigraph and SmartDigraph already have such functions.

Doc improvements, fixes and unifications for graphs (#311)

Doc improvements and unification for graph concepts (#311)

Copyright notices added to scripts

Simple interactive bootstrap script

Merge #298

Merge

Small improvements for NetworkSimplex (#298)

Add a parameter to control arc mixing in NS (#298)

Small improvements in NS pivot rules (#298)

Merge #302

Add creator functions for IdMap and RangeIdMap (#302)

Rename ValueIterator to ValueIt in graph maps (#302)
but keep ValueIterator as an alias in CrossRefMap
(only for reverse compatibility).

Extend maps_test.cc (#302)

Doc improvements for several graph maps (#302)

Merge

Improvements for graph maps (#302)

- Add a count() function to CrossRefMap.
- Add tests for IdMap and RangeIdMap.
- Extend tests for CrossRefMap.
- Improve the doc.

Merge

Also check ReferenceMapTag in concept checks (#312)

Merge

Small doc improvements (#304)

Merge

Rearrange modules (#303)

Small doc improvements

Merge

Unify member names in heaps (#299)

The following renamings are made.

Public members:
- UnderFlowPriorityError -> PriorityUnderflowError
("underflow" is only one word)

Private members:
- bubble_up() -> bubbleUp()
- bubble_down() -> bubbleDown()
- second_child() -> secondChild()
- makeroot() -> makeRoot()
- relocate_last() -> relocateLast()
- data -> _data
- boxes -> _boxes

Move the heaps to a separate group (#299)

Improve and unify the documentation of heaps (#299)
and avoid a warning in SimpleBucketHeap::operator[].

Merge

Much faster implementation for BinomHeap (#301)

Smarter bubbleDown() in K-ary heaps (#301)

Small improvements in heap implementations (#301)

Make K a template parameter in KaryHeap (#301)

Improve and unify the doc + names in the new heaps (#301)

Bug fix in PairingHeap::pop() (#301)

Add fourary, k-ary, pairing and binomial heaps (#301)
These structures were implemented by Dorian Batha.

Merge

Add negativeCycle() function to BellmanFord (#51)

Add a detailed test file for BellmanFord (#51)

Improvements and unifications for BellmanFord (#51)

- Rework the function type interface to fit to dijkstra().
- Rename named template parameters (Def* -> Set*).
- Rename some private member variables
(to start with an underscore).
- Simplify template parameter names.
- Many unifications and improvements in the doc.

Port Bellman-Ford algorithm from SVN -r3524 (#51)

Merge

Improvements for iterable maps (#73)

Port iterable maps from SVN 3509 (#73)

Merge

Bug fix + extension in the rename script (#305)

Merge

Test file + doc improvements (#307)

Bug fix in Preflow and Circulation (#307)

Merge

Merge

Add missing 'explicit' keywords (#311)

Fix the implementation and doc of CrossRefMap (#302)

- Handle multiple values correctly with std::multimap.
- Clarify the problematic points in the doc.
- Add some basic tests for the class.

Unification of names in heaps (#50)

Simplified implementation of bucket heaps (#50)

Port remaining heaps from SVN -r 3509 (#50)

- FibHeap
- RadixHeap
- BucketHeap
- SimpleBucketHeap

Set the version to 'hg-tip' if everything fails

Minor CMake improvements

* Use the empty ELSE(), ENDIF(), ENDMACRO(), etc. syntax since this improves
readability and requires less typing.
* Use FIND_PACKAGE() instead of INCLUDE().
* Use the value of CMAKE_COMMAND variable instead of cmake, since this works
even if cmake is not in the PATH.

Put the version string into config.h

Also make it possible to set the version using the LEMON_VERSION environment
variable, and use the hg revision as version string in case this variable is
unset.

Fix the check for the 'long long' type

Change the label of the html project in Visual Studio

Generate and install LEMONConfig.cmake

Add tools/CMakeLists.txt to the tarball

Rename documentation install folder from 'docs' to 'html'

Remove duplications from doc/CMakeLists.txt

Suppress MSVC warnings using pragmas (#295)

Add artificial addNode() function to the arc/edge set classes

Avoid Intel C++ Compiler warnings

Disable Visual Studio warning C4503

Add lemon/config.h.cmake to the tarball

Resolve GCC-4.4 warnings & fix ambiguous op=() in graph_components.h

Update NEWS file

Extend min cost flow test file + check dual costs (#291)

Fix the GEQ/LEQ handling in NetworkSimplex + improve doc (#291)

- Fix the optimality conditions for the GEQ/LEQ form.
- Fix the initialization of the algortihm. It ensures correct
solutions and it is much faster for the inequality forms.
- Fix the pivot rules to search all the arcs that have to be
allowed to get in the basis.
- Better block size for the Block Search pivot rule.
- Improve documentation of the problem and move it to a
separate page.

Merge

Remove bits/base_extender.h, which is not used at all (#288)

Move list and edge sets to the graph module (#290)

Merge

Change the explanation of the acronym LEMON (#289)

Change Graph::Edge -> Graph::Arc inheritance to conversion (#283)

Change Undirector::Edge -> Undirector::Arc inheritance to conversion (#283)

Fix the faulty merge of unify-sources.sh in [586b65073025]

Doc fixes for lgf-gen (#282)

Merge

Merge

Small doc improvements (#257)

Fix glp_prob definition (#286)

Add a test file for the connectivity functions (#285)
The Euler tools have a separate test file.

Doc improvements and fixes for connectivity tools (#285)
And add loopFree(), parallelFree(), simpleGraph() to the module doc.

Bug fixes in connectivity.h (#285)

- Bug fix in tree().
- Rename simpleDigraph() to simpleGraph() (it works for both
directed and undirected graphs).
- Possibly faster implementation for parallelFree() and
simpleGraph().

Merge

Add the solver libraries to lemon.pc.in (#281)

Merge

Resolve gcc-4.3 warning in lemon/network_simplex.h

Less map copying in NetworkSimplex (#234)

- The graph is copied in the constructor instead of the init() function.
It must not be modified after the class is constructed.
- The maps are copied once (instead of twice).
- Remove FlowMap, PotentialMap typedefs and flowMap(), pontentialMap()
setter functions.
- flowMap() and potentialMap() query functions copy the values into the
given map (reference) instead of returning a const reference to a
previously constructed map.

Rename Flow to Value in the flow algorithms (#266)

We agreed that using Flow for the value type is misleading, since
a flow should be rather a function on the arcs, not a single value.

This patch reverts the changes of [dacc2cee2b4c] for Preflow and
Circulation.

Support negative costs and bounds in NetworkSimplex (#270)

* The interface is reworked to support negative costs and bounds.
- ProblemType and problemType() are renamed to
SupplyType and supplyType(), see also #234.
- ProblemType type is introduced similarly to the LP interface.
- 'bool run()' is replaced by 'ProblemType run()' to handle
unbounded problem instances, as well.
- Add INF public member constant similarly to the LP interface.
* Remove capacityMap() and boundMaps(), see also #266.
* Update the problem definition in the MCF module.
* Remove the usage of Circulation (and adaptors) for checking feasibility.
Check feasibility by examining the artifical arcs instead (after solving
the problem).
* Additional check for unbounded negative cycles found during the
algorithm (it is possible now, since negative costs are allowed).
* Fix in the constructor (the value types needn't be integer any more),
see also #254.
* Improve and extend the doc.
* Rework the test file and add test cases for negative costs and bounds.

Merge

Check the version number in FindGLPK (#277)

Add GLPK_ROOT_DIR variable to FindGLPK (#277)

Link libm and libpthread if using CPLEX (#277)

Add CPLEX_ROOT_DIR variable to FindCPLEX (#277)

Look for COIN libraries with and without the lib prefix too (#277)

This is necessary because on Windows when built using autotools the COIN
libraries are named in UNIX style, i.e. libCbc.lib insetad of Cbc.lib.

Merge

Merge

Remove superfluous HAVE_CONFIG_H (#278)

Add cbc.h to lemon/Makefile.am (#279)

Fix Makefile.am EXTRA_DIST (#276)

Merge

Merge and extend the fix of #275

Merge

Modify the interface of MinCostArborescence + improvements (#267)

- Rename arborescenceValue() to arborescenceCost().
- Rename DefXyz template named paramaters to SetXyz.
- Rearrange public functions (for better doc).
- Doc improvements.
- Extend the test file with interface checking.

Merge

Modify the interface of Suurballe (#266, #181)

- Move the parameters s and t from the constructor to the run()
function. It makes the interface capable for multiple run(s,t,k)
calls (possible improvement in the future) and it is more similar
to Dijkstra.
- Simliarly init() and findFlow(k) were replaced by init(s) and
findFlow(t,k). The separation of parameters s and t is for the
future plans of supporting multiple targets with one source node.
For more information see #181.
- LEMON_ASSERT for the Length type (check if it is integer).
- Doc improvements.
- Rearrange query functions.
- Extend test file.

Support infinite bounds in Circulation + fixes (#270, #266)

- Support infinite capacities.
- Bug fix in upperMap().
- Fixes and improvements in the documentation.

FindCOIN for CMake (#256)

FindCPLEX for CMake (#256)

FindGLPK improvements (#256)

Merge

Fix and uniform the usage of Graph and Parent typedefs (#268)

- Rename Graph typedefs to GraphType in the implementation of graph
maps and MapExtender to prevent conflicts (especially using VS).
They are not public.
- Make Parent typedefs private in all classes.
- Replace Digraph with Graph in some places
(fix faulty renamings of the script).
- Use Graph and Digraph typedefs (more) consequently.

VS compatibility fix (#268)

Exploit the changes of #190 in MCF test file (#234, #190)

Support LEQ and GEQ supply constraints in dimacs-solver (#234, #219)

Bug fix in NetworkSimplex (#234)

Fix usage of sqrt() (#268)

Merge and fix

Slightly modify the interface of Circulation and Preflow (#266)
in order to synchronize them to the interface of NetworkSimplex.

Circulation:
- The "delta" notation is replaced by "supply".
- lowerCapMap(), upperCapMap() are renamed to lowerMap() and upperMap().
- Value is renamed to Flow.

Preflow:
- Value is renamed to Flow.

Support >= and <= constraints in NetworkSimplex (#219, #234)

By default the same inequality constraints are supported as by
Circulation (the GEQ form), but the LEQ form can also be selected
using the problemType() function.

The documentation of the min. cost flow module is reworked and
extended with important notes and explanations about the different
variants of the problem and about the dual solution and optimality
conditions.

Support real types + numerical stability fix in NS (#254)

- Real types are supported by appropriate inicialization.
- A feature of the XTI spanning tree structure is removed to ensure
numerical stability (could cause problems using integer types).
The node potentials are updated always on the lower subtree,
in order to prevent overflow problems.
The former method isn't notably faster during to our tests.

Separate types for flow and cost values in NetworkSimplex (#234)

Support multiple run() calls in NetworkSimplex (#234)

Rework the interface of NetworkSimplex (#234)

The parameters of the problem can be set with separate functions
instead of different constructors.

Use XTI implementation instead of ATI in NetworkSimplex (#234)

XTI (eXtended Threaded Index) is an imporved version of the widely
known ATI (Augmented Threaded Index) method for storing and updating
the spanning tree structure in Network Simplex algorithms.

In the ATI data structure three indices are stored for each node:
predecessor, thread and depth. In the XTI data structure depth is
replaced by the number of successors and the last successor
(according to the thread index).

Internal restructuring and renamings in NetworkSimplex (#234)

Support min cost flow in dimacs-solver (#234)

Port NetworkSimplex from SVN -r3520 (#234)

Merge

Merge

Add more docs to LGF function interface (#109)

Fix in HaoOrlin (#264)

Improvements and fixes for the minimum cut algorithms (#264)

Merge

Rename max_matching.h to matching.h (#265)

Extend and modify the interface of matching algorithms (#265)

- Rename decomposition() to status() in MaxMatching.
- Add a new query function statusMap() to MaxMatching.
- Add a new query function matchingMap() to all the three classes.
- Rename matchingValue() to matchingWeight() in the weighted
matching classes.

Improvements for the Euler tools and the test file (#264)

Bug fix in the Euler iterators (#264)
Handle the case when the first node is isolated.

Imporvements for the matching algorithms (#264)

Merge

Merge

Rotate and enlarge some images (#262)

Add images + fixes in the doc of connectivity tools (#262)

Improve test files for some algorithms (#263)

Small doc improvements (#263)

Merge

Remove notes about reference maps as extra features (#190)

Exploit that the standard maps are reference maps (#190)

Standard graph maps are required to be reference maps (#190)

Various improvements and fixes (mainly in the doc) (#190)

Merge

Merge

Unified message handling for LP and MIP solvers (#9)

Force cplex checking (#260)

Add RangeIdMap, CrossRefMap to the rename script (#160)

Merge

DescriptorMap->RangeIdMap, InvertableMap->CrossRefMap (#160)

Merge

Fix compilation with MSVC (#259)

Fix compilation with MSVC (#258)

Single check macro for all COIN-OR dependencies (#204)

Add CBC support (#204)

Silent glp_adv_basis() (#255)

Fixing presolver and basis handling (#255)

Add 'demo' make target for building the demo programs

Fix in .hgignore

Merge

Accept negative values as unbounded capacity in dimacs readers (#243)
and some doc improvements.

Merge

Various doc improvements (#248)
- Rename all the ugly template parameters (too long and/or starting
with an underscore).
- Rename function parameters starting with an underscore.
- Extend the doc for many classes.
- Use LaTeX-style O(...) expressions only for the complicated ones.
- A lot of small unification changes.
- Small fixes.
- Some other improvements.

Improve timer and counter tests (#253)

- Do not print the output of counter_test.cc.
- Check the output of counter_test.cc.
- Shorten the running time of time_measure_test.cc.

Merge

Merge

Fix and extend the migration script (#245)

Bug fix in unify-sources.sh (#245)

Merge

CMake subproject support fixes (#240)

Fix lp related errors and warnings (#241 and #242)

Switch on warnings when compiling the lib

Make it possible to use LEMON as a CMake subproject (#240)

Merge

Merge

Doc improvements in GomoryHu (#66)
And make init() and start() private + bug fix in the test file.

Remane GomoryHuTree to GomoryHu (#66)

Cut iterators for GomoryHuTree + doc cleanup + bug fixes (#66)

Porting Gomory-Hu algorithm (#66)

Merge

Remove \bug and \todo comments

Fix newSolver()/cloneSolver() API in LP tools + doc improvements (#230)
- More logical structure for newSolver()/cloneSolver()
- Fix compilation problem with gcc-3.3
- Doc improvements

Fix Soplex config in autoconf (#230)

Automatic GLPK env deallocation (#213)

Fix GLPK tests (#213)

Merge

Merge

Merge

Merge

Small improvements in DIMACS solver (#226)

Avoid warnings in test/euler_test.h (#65)

Merge

Fix the naming convention of guards and remove one unnecessary include

Merge

CMAKE builds the tools/ dir, too (#228)

DIMACS solver utility (#226)

dimacs.h reads MAT files to both dir and undir graphs (#231)

Option for lgf-gen to draw the edges only

Port lgf-gen from SVN -r3512 (#45)

- apply the migrate script
- apply the source unifyer
- fix the compilation

Test for euler.h (#65)

Rename euler() to eulerian() (#65)

Port Euler walk tools from SVN -r3512 (#65)

Fix several missing includes (#232)

Merge

Merge

Use pathCopy(from,to) instead of copyPath(to,from) (#321)
The old version is kept as a deprecated alternative.

Slightly simplify adaptors_test.cc

Fix in pathSource() and pathTarget() (#250)
and extend the doc.

Remove duplicate list_graph.h entry from source list (#308)

Do not distribute lemon/config.h and fix its bad include by core.h (#280)

Prefix macro names with LEMON_ in lemon/config.h (#275)

Install lemon/config.h (#274)

unify-sources.sh refresh the dates according to the last modification

Small script making a release

LEMON is a COIN-OR project now

Minor fix in the LICENSE file

Fix missing 'inline' specifier in time_measure.h (#239)

Also note the cmake based build environment in INSTALL file

Various doc improvements

Include /lemon/config.h globally (#230)

Port MinCostArborescence algorithm from SVN #3509

CMAKE config improvements
- install docs in share/doc/
- look for newer versions of Ghostscript

Merge

Various fixes for compiling on AIX (#211, #212)

Default implementation of Tolerance<> is used for integer types (#229)

Add long long checking to build systems (#230)

Fixes in adaptors.h to compile on AIX

Add cmake/cmake.version to .hgignore

Further fixes to windows.cc (#215)