Bug fix resetting activeness of node at initialization

Fix warning when compiling with -Wall.

Performance bug in Preflow
The initial relabeling moved each node to the lowest level
Doc bug fix

Bugfix: using read-write map instead reference map

Better solution

Changed queue implementation

Bugfix in min cut computation

Small changes in the documentation.

Nauty graph6 reader

Changing max flow interface

Redesign the maximum flow algorithms

Redesigned interface
Preflow changed to use elevator
Edmonds-Karp does not use the ResGraphAdaptor
Goldberg-Tarjan algorithm (Preflow with Dynamic Trees)
Dinitz-Sleator-Tarjan (Blocking flow with Dynamic Tree)

Query the result value of an expression

Elevator: slight changes in elevator interface
LinkedElevator: based on linked lists

IntegerMap

removing semicolon ftom the end of GRAPH_TYPEDEFS

Small changes in the min. cost flow classes.

Planar graph coloring

Small bug fix.

Change to new union-find interface

Redesign interface of MaxMatching and UnionFindEnum
New class ExtendFindEnum

Faster MaxMatching

Bug fix

Fix a typo that caused the failure of 'make dist'

BpUGraphReader and Writer

Forgotten images

planar doxygen group

Planar Grid Embedding

Bug fix in undirected graphs (adding loops)
Bug fix in undirected edgesets (alteration notifying)

Redesigned undirected edgesets (like the smart or ugraph)

Build fix.

setAll for iterable bool maps

Added the function isFinite(), and replaced the calls to finite() with it.
This was necessary because finite() is not a standard function. Neither can
we use its standard counterpart isfinite(), because it was introduced only
in C99, and therefore it is not supplied by all C++ implementations.

Makefile fix.

Bad documentation

Adding doc

Documentation for lemon tools

Minor bug fixes in documentation

Bug fix and redesign StdMap
Improving map adaptors documentations

Bug fix in MaxMatching

Removing other occurences of cnt

Doc bug fix

New developers page
The participation period should be included

Bug fix in doc related to Graph concpets

Removing some todos!

make it compatible with current version of glpk

- Gamma distributon random variable.
- Test file for random.h

Missing header file added.

Avoiding warnings

Planarity checking and embedding

Once again bug fix in significant bit calculation

The same for unsigned radix sort

Bug fix in most significant digit calculation

Bug fixes in the documentation (mainly bad references).

Generate tools documentation

Small bug fixes and changes in the documentation.

Small improvement in documentation.

Missing header.

Small changes in min. cost flow algorithms.

Small bug fixes.

Invalid assignments ambiguity handling

More simple interface for PathDumper

PathNodeIt

PathWriter/Reader structures
Distinict MapSet readers and writers

Redesign of augmenting path based matching
Small bug fix in the push-relabel based

Consider the CPXMIP_OPTIMAL_TOL status as OPTIMAL too.

uedgeset is an alias for edgeset

Query functions: aMatching and bMatching
Modified algorithm function interfaces
ANodeMap<UEdge> matching map
BNodeMap<bool> barrier map

Consistency between augmenting path and push-relabel algorithm

Common interface for bipartite matchings
Some useful query function for push-relabel based matching

The naming should be rethink for these classes
for example: pr-ap prefix for push-relabel and augmenting path
algorithms

Reporting invalid ID

Correction in the line numbering method

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