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