Sample input for sat-2 and sat demos

The mip column addition hack is necessary only for 4.16

Improvments in min cost flow algorithms
- improved cycle cancelling

Space reservation for SmartGraph

Doc improvments

Using set() instead of assignment

Spellcheck

Correction for multiple point on starting sweep line

Update the demo file of Circulation

Two new constructors added to dim2::BoundingBox

Negate the meaning of the delta parameter

Minor improvement in Tutorial

Bugfix and improvement in -tsp2 algorithm

Delaunay triangulation
Faster geometric minimum spanning tree

A minimum spanning tree based TSP algorithm is added (-tsp2)

- Fix a serious bug in UEulerIt
- Add a conversion to UEdge
- Make some member funtions to be 'const'

Patch in network simplex

Patch from Peter Kovacs

Patch for retrieving reached/processed node in dijkstra, bfs and dfs

Patch from Peter Kovacs

Bug fix

Conformity to new GLPK interface
Hacking Mip without integer variables

Various min cost flow solvers

Patch from Peter Kovacs

Modified start() function in Dfs and Dijkstra classes to give back reached
edge/node.

Patch from Peter Kovacs

Bug fix in Bfs class.

Patch from Peter Kovacs

Small improvements in MinMeanCycle class.

Patch from Peter Kovacs

Integer parameters also convert to double

Fix the bug

Test the repository checking service

Fix the test bug

Sorry...

fix to compile with gcc 4.1.2

Test broken repository warning

Renaming topology doxygen group

Doc change

Clear for unionfinds

Allowing 'string' type quoting

Helper classs for checking existence of a nested class

Redesigned Kruskal algorithm

The interface of function type implementation is not changed
Additional class type implementation

Corrections on StoreBoolMap
- *insert_iterator has void value_type
- use const setting

Doc fix

Small changes

Demo program for SAT problems

Added SimplePath::front().

Slight modifications.

Parameter reordering

Patch from Kovacs Peter

Small improvments

I only corrected bugs to make things compile: some featured not implemented here yet.

Bug fix
Wrong renaming

Right dimacs format for min cost flows
Bug fixes in tolerance and min_mean_cycle

Append the svn revision number to the version string automatically.

Bug fix

dim_to_lgf
- use the argparser class
arg_parser improvments
- usage of assert in cc
- const char** argv
error
- handling the string parameter

Minimum mean cycle algorithm contributed by Peter Kovacs.

Doc improvements contributed by Peter Kovacs.

Using LEMON_ASSERT instead of LogicError()

Better doc.

Missing template keyword bug

dim_to_lgf has been moved to tools/ (from demo/)

The lemon repository has been renamed

An improved version of ArgParser: You don't need to give an explicit storage
for each option.
TODO: Documentation must be updated

Data hiding
Const members

Steiner 2-approximation demo

More query functions

Little interface improvment

Some design correction

naming convention:
header sentry

Correction of urls and email addresses

Bug fix missing include

Bug fix
from Kovacs Peter

Bug whit Parent typedef in SplitGraphAdaptor::CombinedEdgeMap
Fixing graph to eps parameters for demo

Happy New Year to all source files!

- '-Wshadow' seemed to strict therefore removed
- a tools directory added for useful executables codes
- tools/lgf-gen.cc (a random graph generator) added

arg_parser.h: A command line argument parser.
dist_log.h: A tool for measuring one and two dimensional distributions.

More doc.

Fix icc compilation failures

Hard Warning checking
- based on the remark of the ZIB user
- we do not use -Winline

Bug fix
Setting _pred in init()

getNotifier to notifier renaming

steiner.h into the makefile

2-approximation of Steiner-tree problem

Bug fix

ball2() -> disc() renaming

Prescaling can be turned off

Once again minor doc changes

Minor changes

Reorganization of the modules and groups

A preflow based general network circulation algorithm and a simple demo

Some two dimensional random distribution added.
They should be revised.

Doc improvements

Adding original license to the file
+ buffered bit generation

Minor fix

Some documentation changes

Naming convention changes

setObj => obj
is_min => isMin
is_max => isMax

Bug fixes
Documentation

More adequate doc.

Using const in lp interface
colByName functionality

Check Soplex support, as well

Lp row and col getter function
lp section reader and writer for lemon IO

Changes on the LP interface

_FixId => LpId
- handling of not common ids // soplex
LpGlpk row and col erase bug fix
- calling lpx_std_basis before simplex
LpSoplex
- added getter functions
- better m4 file
- integration to the tests
- better handling of unsolved lps

Small changes

Implemented virtual functions of class LpCplex.

Lagrange relaxation based algorithm for the delay constrained least cost
path problem.

Some spellcheck

Dijkstra could return the temporarly distance of the current node

Some bug fix
RevIt => RevEdgeIt renaming

Further doc improvements

Two new distributions added:
- Gaussian distribution generated using the polar form of the Box-Muller
transformation,
- Exponential distribution generated using inverse cdf.

Doc improvements

A push/relabel type max cardinality matching implementation.
(slightly incompatible with bipartite_matching.h)

Doc improvements

Correction of the wrong base class

Several doc improvements.

Small bug corrected.

- Some bugfixes
- Better doc
- liftToTop(), liftTo() added

Spellcheck

elevator.h: A class for handling item labels in push-relabel type algorithms

One important thing only: equality-type constraint can now be added to an lp. The prettyPrint functions are not too pretty yet, I accept.

Bug fix

G++-3.3 conform solution

Bug fix

Undirected minimum cut benchmarking

Make Hao-Orlin epsilon-safe

Bug fix

Changing implementation of undirected graphs
slightly faster, 10% speed-up

Adding two heuristics
Based on:
http://www.avglab.com/andrew/pub/neci-tr-96-132.ps

Nothing serious.

New path concept and path structures

TODO: BellmanFord::negativeCycle()

I only corrected some errors in the documentation.

MACROS for debug map usage

Bug fix

Easier inverse than m.inverse()[a] => m(a)

Better handling of inexact computation.
We do not use tolerance for excess, just for edges

clone => build renaming

Query functions have been implemented for GLPK (CPLEX breaks at the moment, I guess): These functions include:
retrieving one element of the coeff. matrix
retrieving one element of the obj function
lower bd for a variable
upper bound for a variable
lower and upper bounds for a row (these can not be handled separately at the moment)
direction of the optimization (is_max() function)

More sophisticated warning messages.

Fix 'unused variable' warnings

Oops. I did not mean to break the repository.

Some query functions got implemented, but only for GLPK.

Check for gcc version 3.3, 3.4 and 4.0 as well

Send the output to /dev/null

Copy constructor for LpGlpk

Automatic doc generation from the SVN trunk

- Change the subjects of broken repository mail alerts.
- Do not send the log file to the list

Send broken repository alert also to lemon-commits@lemon.cs.elte.hu.

Put server services related scripts under the server-services folder.

Lp section reader

Configuration files for soplex

checking soplex

Preliminary soplex support

modified _setColCoeff and _setRowCoeff parameters
const simplify() for expressions

make 'commit-checker' silent

- update graph_oriantation.cc to be in line with the renamed xy and with the
new graphToEps() scaling.
- Fix and external directory build problem in Doxyfile.in

Make the constructors of ColIt public.

Erasing unionfind Item template parameter

Some doc fix

BfsVisitor
Bipartite partitions based on visitors

topology_demo.cc => scaleToA4 works without extra parameters

Keeping order of alteration observers

Removing some automatic callback generation
// exception safety reason

Doc fix.

ColIt added. (Untested, but at least it compiles.)

Test the automatic compilation checker 1/2: fix the repo again

Test the automatic compilation checker 1/2: make a bug

Conditional execution until the target is reached
/previous implementation: until the target is the next to process/

todo: query the target when we give nodemap as condition

Bugfix: didn't removed the lock file if something went wrong

Test the automatic compilation checker 3/3: fix repo again

Test the automatic compilation checker 2/3: wrong commit

Test the automatic compilation checker 1/3

Send message to the commit author, as well

Script for automatic checking of SVN commit's consistency

First implementation of the static graph class
It could be improved to get better running times on benchmarks

General mapping based variant type

Spellchecking

GraphCopy and UGraphCopy modifications
Preliminary support for static graphs
=> cloning graphs

Added BpUGraphCopy

Tests for graph copies

Strict checking disabled

Corrected some typos and grammatical errors.

Removing template Map template parameter from InvertableMaps

The implementation of the graph copy is changed
Make explicit more constructors

Bug fix

Renaming MinCut

Bug fix

Bug fixes

tutorial update
algorithms, and graph visualisation

One more refinement

Update scripts

update for version 0.6

icpc-9.0 compilation bugfix

Min cost flow is renamed to SspMinCostFlow

Small bugs in the documentation 2.

Turn off 32 bit only tests, cont'd.

Small bugs in the documentation.

Turn off 32 bit only tests.

repository cleanup

- Add an autopackage generator script for glpk
- update autopackage specfile

Bug fix for removing heap Item from template parameter list

ColName() -> colName(), Coeff() -> coeff()