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)