Include functional because of std::less.

Changing degree of tournament tree
Bug fix in union find
Small efficiency improvment in bipartite matchings

Test program for max weighted matchings

Edmond's Blossom shrinking algroithm:
MaxWeightedMatching
MaxWeightedPerfectMatching

Renaming state_enum to State
Removing "Type" suffix from typedefs
Moving implementation into the class definition

Bug fix in erase

Casting index to int

Bug fix (Circulation interface changed).

Change the local variables lower case

Bug fix

Bug fix

Avoiding warnings

DynEdgeLookUp implementation based on splay trees
In general case it is slower than the static version, but it should not
refreshed on the change of the graph

Bug fix in doc

Using operation traits in dijkstra

Modified rename script (BpGraph instead of Bigraph).

Redesigned CapacityScaling algorithm with almost the same interface.
The new version does not use the ResidualGraphAdaptor for performance reasons.
Scaling can be enabled and disabled with a parameter of the run() function.

Improved docs.

Bug fixes.

Bug fixes in the rename script.

rename graphs script

Reimplementation of Hao-Orlin algorithm
Little modifictaion in NagamochiIbaraki
More docs for minimum cut algorithms

Minor changes

Gomory-Hu tree algorithm

bug fix
class without constructor error

Redesign Circulation interface according to new flow interface
New greedy approach initialization

Using linked elevator
It is conform to the Graph concept in that sense
the graph maps should not be ReferenceMap

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