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)