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

Fixes in adaptors.h to compile on AIX

Merge

Dirty hacking for VS 2005 in lp_base.h (#209)

Merge

Fixes for MSVC 2008 in grap_adaptors.h and edge_set.h (#194)

Several renamings and changes in adaptors and edge sets

- Fixing scope usage for MSVC
- ResidualDigraph based on SubDigraph instead of FilterArcs
- Use initialize() in adaptors and edge sets
- Wrap ListDigraph for edge set tests

Change LEMON's isnan() to isNaN() for the sake of AIX/xlC

Certain xlC versions implement isnan() as a #define.

Fix in lp_base.cc targeting AIX/xlC compatibility

Merge

Merge (manually add cmake/FindGLPK.cmake to Makefile.am)

Suppress or fix VS2008 warnings + turn off faulty tests using CMAKE (#208)

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