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

Small script making a release

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

LEMON is a COIN-OR project now

Merge

Fix and extend the migration script (#245)

Bug fix in unify-sources.sh (#245)

Merge

Minor fix in the LICENSE file

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

Fix missing 'inline' specifier in time_measure.h (#239)

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

Also note the cmake based build environment in INSTALL file

Merge

Merge

Merge

Various doc improvements

Small improvements in DIMACS solver (#226)

Avoid warnings in test/euler_test.h (#65)

Include /lemon/config.h globally (#230)

Merge

Fix the naming convention of guards and remove one unnecessary include

Merge

Port MinCostArborescence algorithm from SVN #3509

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

CMAKE config improvements
- install docs in share/doc/
- look for newer versions of Ghostscript

Merge

Merge

Various fixes for compiling on AIX (#211, #212)

Default implementation of Tolerance<> is used for integer types (#229)

Add long long checking to build systems (#230)

Fixes in adaptors.h to compile on AIX

Add cmake/cmake.version to .hgignore

Further fixes to windows.cc (#215)

Merge

Wrap around the usages of windows.h

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

Set the compatibily related MSVC defines only if they has't been defined yet

Compilation bug fixed in graph_to_eps.h with VS2005 (#214)

Add missing include to time_measure.h

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

Set the proper version for CMAKE in the tarballs (made by autotools).

Enable the component-based installer

Update the lemon icon

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

Merge

Fix 'make install' without 'make html' using CMAKE (#207)

Fix CMAKE build without GLPK

Build GLPK dependent parts with CMake too

(.hg)ignore more build-like dirs (*objs* and *build*)

Fix lp indexing bug (#205)

Own support for isnan()

Merge

ArcSet and EdgeSet ports from SVN 3489 (ticket #67)

Merge

Rename graph adaptors with the migration script (#67)

Rename graph_adaptor_test.cc to adaptors_test.cc (#67)

Rename Residual to ResidualDigraph (#67)
The new name is more analogous to other adaptor names.

Greatly extend and improve the test file for adaptors (#67)

- Add concept checks for the alterable, extendable, erasable
and clearable adaptors.
- Add test cases for modifying the underlying graphs through adaptors
whenever it is possible.
- Check the conversions between Node, Arc and Edge types.
- Add more test cases for the adaptor-specific functions and maps:
enable(), disable(), status(), forward(), backward(), CombinedArcMap,
CombinedNodeMap, ResidualCapacity etc.
- Use checkGraphIncEdgeArcLists() to simplify the test cases for
undirected graphs.
- Add test cases that use static graph structure (GridGraph) with
several adaptors combined.
- Add comments for the test cases.

Rename Lp*/Mip* to *Lp/*Mip

Remove lp_ prefix from the solver's header name

Bypass warnings with gcc 4.3

Thorough redesign of the LP/MIP interface (#44)

- Redesigned class structure
- Redesigned iterators
- Some functions in the basic interface redesigned
- More complete setting functions
- Ray retrieving functions
- Lot of improvements
- Cplex common env
- CLP macro definition to config.h.in
- Update lp.h to also use soplex and clp
- Remove default_solver_name
- New solverName() function in solvers
- Handle exceptions for MipCplex test
- Rename tolerance parameter to epsilon
- Rename MapIt to CoeffIt
- Lot of documentation improvements
- Various bugfixes

Port LP and MIP solvers from SVN -r3509 (#44)

Add HAVE_LP and HAVE_MIP #defines

Ignore standard .m4 files

Merge

Update lemon/adaptors.h's header to 2009

Remove non-checked subgraph adaptors + rename parameters (#67)

Rename convenience functions in subgraph adaptors (#67)

- Rename hide(), unHide() to disable(), enable().
- Add new set function status(Item, bool).
- Remove hidden() and add status() instead
(which returns the opposite value).

Various doc improvements for graph adaptors (#67)

- Add notes about modifying the adapted graphs through adaptors
if it is possible.
- Add notes about the possible conversions between the Node, Arc and
Edge types of the adapted graphs and the adaptors.
- Hide the default values for template parameters (describe them
in the doc instead).
- More precise docs for template parameters.
- More precise docs for member functions.
- Add docs for important public typedefs.
- Unify the docs of the adaptors.
- Add \relates commands for the creator functions.
- Fixes and improvements the module documentation.

Add creator functions for Residual and Residual::ResidualCapacity (#67)

Various bug fixes and code improvements in adaptors.h (#67)

- Fix UndirectorBase::nodeNum().
- Fix UndirectorBase::findEdge().
- Fix OrienterBase::addArc().
- Fix OrienterBase::findArc().
- Improve SplitNodesBase::findArc().
- Add missing notifier() function in UndirectorBase.
- Add missing typedefs for maps (conform to the ReferenceMap concept).
- Add some useful typedefs for graph adaptors.

Add missing const keywords (+ remove misleading ones) (#67)

Avoid warning in adaptors.h (#67)

Fix the usage of tags in adaptors.h (#67)
There are separate tags for arcs and edges now.

Merge

Update to 2009 plus whitespace unification

Rename counterSort to stableRadixSort

Doc improvements and source unification in radix_sort (#72)

Porting radix sorts from SVN #3509

Happy New Year again
- update the copyright headers + run the source unifier

Merge bugfix #197

Bug fix in heap unionfind (ticket #197)

The previous bugfix set the minimum value in internal nodes
wrongly. It corrects the problem.

Merge bugfix #197

Bug fix in heap unionfind (ticket #197)

The minimum item in the unionfind tree might become inconsistent when
the split operation merges two subtrees which have equal keys. The
current changeset fix the problem. It also fix a wrong index.

Merge

Merge

Merge

Merge

Hide all docs in variant.h (#196)

Bug fix in variant.h (#196)

Bug fix in ConEdgeIt (#195)

Merge

Fix skipSection() function (ticket #193)

Merge

Fix typos (ticket #192)

Update test/CMakeLists.txt and test/Makefile.am

Inline the test input files into the source code

chg-len.py does not scan any hg config file now

Merge

Add missing 'const' for query functions of algorithms

Renamings in connectivity.h and bug fix in DfsVisit (#61)

- The include guard, the private namespace and some local varibles
are renamed
- The stop() must be called in DfsVisit, if there are not outgoing
arcs from the added node

Merge

Port topology.h as connectivity.h from SVN -r3509 (#61)

Reorganication of graph adaptors and doc improvements (#67)

- Moving to one file, lemon/adaptors.h
- Renamings
- Doc cleanings

Improvements in graph adaptors (#67)

Remove DigraphAdaptor and GraphAdaptor
Remove docs of base classes
Move the member documentations to real adaptors
Minor improvements in documentation

Port graph adaptors from svn -r3498 (#67)

Merge

Minor doc improvements in HaoOrlin (#58)

New queue implementation for HaoOrlin class (#58)

Simple test for HaoOrlin algorithm class (#58)

Port Hao-Orlin algorithm from SVN -r3509 (#58)

Merge

Merge

Improvements in groups.dox (#188)

- Unify the notations used for formulas.
- Add 'namespace lemon {...}' to simplify the references.
- Improved doc for algorithm groups.
- Extend the doc of the "shortest path" and "minimum cost flow" modules.

Doc improvements for Bfs, Dfs, Dijkstra (#185)

- More precise references to overloaded member functions.
- Hide the doc of the traits class parameters.
- Better doc for named groups.
- More precise doc for the case of multiple sources in Dfs.

Merge

Improve test file for Circulation (#175)

- Bug fix: add a missing #include.
- Add compile test for various functions and named parameters.
- Use a smaller digraph with lower bounds.
- Test eight instances instead of two.
- Remove the doc that was for the demo file.

Many doc improvements for Circulation (#175)

- More precise doc for members.
- Several doc fixes.
- Add doc for public types.
- Better formulations.
- Add useful notes to the problem description.
- Use supply instead of excess in the doc.
- Hide the doc of the traits class parameter.
- Use \tparam for template parameters.

Def->Set change in lemon/circulation.h

Transform circulation demo to test

Port Circulation from svn -r3516 (#175)
Namely,
- port the files
- apply the migrate script
- apply the unify script
- fix the compilation
- strip the demo input file
- break long lines

Merge

Remove DijkstraWidestPathOperationTraits (#187)

Improve unify-sources.sh (#186)
Errors can also be accepted when the script is used as a hg hook.
Sometimes it is useful (e.g. if someone else made the errors).

Merge

Better test files for Preflow (#176)

- Slightly improve preflow_test.cc.
- Change preflow_test.lgf to meet the new LGF format
and remove trailing tabs.

Many doc improvements for Preflow (#176)

- More precise doc for members.
- Add doc for public types.
- Hide the doc of the traits class parameter.
- Removing \author comments.
- Use \tparam for template parameters.

Rename flowInit() to init() in Preflow (#176)

Def -> Set renaming in Preflow

Get rid of exceptions in Preflow

Port preflow push max flow alg. from svn -r3516 (#176)
Namely,
- port the files
- apply the migrate script
- apply the unify script
- break the long lines in lemon/preflow.h
- convert the .dim test file to .lgf
- fix compilation problems

Doc improvements for the DIMACS tools (#167)
The doc group is moved to groups.dox.

Refactoring of DIMACS tools

Give different names to the different DIMACS readers

Port DIMACS tools from svn -r3516

Namely,
- apply migrate script
- apply unify sources
- break long lines
- Fixes the compilation
- dim_to_lgf -> dimacs-to-lgf
- better .hgignore
- shorten the doc of dimacs-to-lgf

Merge

Doc improvements for elevator classes (#174)

Don't assume that the default maps are reference maps (in Elevator)

Avoid STL panic at Elevator when compiled with -D_GLIBCXX_DEBUG

Rename markToBottom() to dirtyTopButOne() + better doc (#174)

Port Elevator from svn -r3516 (#174)
- the unify script hes also been applied

Merge

Bugfix in Random (#173)

- operator()s always return a double now
- the faulty real<Num>(Num) and real<Num>(Num,Num) have been removed

chg-len.py uses the Mercurial API directly

This makes chg-len.py much faster.

Merge

Extend test cases for graphs and digraphs (#172)

Bug fix in SmartGraph::restoreSnapshot() (#171)

Avoid bit operator precedence warning with gcc-4.3

Some of these warnings are actually revealed real bugs

Merge

Critical bug fix in SmartDigraph::split() #170

Merge

Add missing tags and functions for item counting in SmartGraph (#3)

Hide "used files" on the doc pages

Merge