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 bugfix #330 to branch 1.1

Merge

Merge bugfix #330 to branch 1.0

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)

Merge fix #321

Merge bugfix #322

Merge bugfix in #250

Merge #317

LEMON 1.1.1 released (78b7231f0b2e tagged as r1.1.1)

Update NEWS file

Merge bugfix #307

Merge bugfix #311

Merge bugfix #302

Merge bugfix #302

Merge several CMAKE related improvements

Merge fix #295

LEMON 1.1 released (06f816565bef tagged as r1.1)

Merge various fixes

Merge

Remove references of missing tools (#257)

Release branch 1.1 created

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