I forgot to remove the benchmarking part of code

UnionFind
Changing the representation of the union-find
it has the same running time but it takes just 2/3 space
! does not auto insert items /performance/

UnionFindEnum
Changing the interface - more convenient to UnionFind
Does not based on the stl data structures /it could be disadvantage/
=> does not use singular iterator assignment /not stl conform, but always work/
Just new iterator interface

MaxMatching + UnionFindTest
Using new iterator interface instead of the old

Some doc fix

Signaling alterations in BpUGraphs

New map type based on array map for debugging purpose

It checks multiple allocation and deallocation of map values and
some consistency.

todo:
clarification of debugging concepts
assertions - exceptions - debug
revision of attic/debug.h

motto:
testing is at least so important as coding

Bug fix in DescriptorMap
Avoiding the possibility of the memory leak

An easy avoiding of a bug

The functional interfaces are removed.
Better solution could be a reference counted core of the io interfaces

Now it is huge work so just write that:

GraphReader<ListGraph>(std::cin, graph).

Instead of:

graphReader(std::cin, graph).

Bug fix

Using abort() instead of exit(1)

If a program is aborted then the call stack can be analyzed with debugger.
The exit(1) does not provides that.

Disable mip_test when no LP solver is available.

Add missing Tutorial dox files

Tutorial improvements by Mark (mqrelly)

'make doc' is now working also in case of external build.

Bug fix in SmartEdgeSet

+ validity check function

Bug fix
rethrow of exception missing

Proper exception handling in the SmartEdgeSet

Snapshot for SmartUGraph an SmartBpUGraph

Bug fix in ListBpUGraph

Snapshot improvments

Improvment in exception handling
The erase and clear handlers have to be exception safe.
These can throw only one exception which detach the observer
from the notifier

Bug fix in UndirGraphAdaptor

Bug fix in countANodes/countBNodes

Fixed the mip error (mipstatus was incorrect).

Doc improvementst & todos

Update header list

bezier.h is no longer in the repository.

Omit warnings

Omit warning
Using check instead of the LEMON_ASSERT
Using fixed graph

Remove superfluous include headers

- bezier.h went to lemon/bits/
- new graphToEps() option: absolute/relative node size/link width scaling.

BiVariant moved to lemon/bits/variant.h

Doc fix

Doc improvements

Some color constants added (BLACK, WHITE, RED etc)

Resolve unused variable warning.

- Change ColorSet to Palette
- Minor change in graph_orientation demo.

This script creates/updates the copyright header of a source file

Do not list the header itself.

This script lists all the header files included directly or indirectly by a certain header file.

CPLEX 9.x support.

Fixed the mailinglist link and removed the gui section.

More "doxygenish" syntax.

Maybe useful, feel free to remove if not.

long long just for gnu compilers

Improving UGraph and BpUGraph concept classes

make public what() in NodeSetError

Omit warning

Change source and target for the bipartite list graph
Some documentation corrections

Minor doc improvement

Minor doc improvement

- Doc improvements
- rot180() added to xy.h

spellcheck

Minor doc changes.

Tolerance<unsigned int> and Tolerance<unsigned long long int> added.

Better 'Naming Convention' conformance.

Bugfix

exceptionName() has been thrown away

Disable assertions in default behaviour
Documentation changed

Some tests added to the test file mip_test.cc. One problem is the verbosity of the mip solver in glpk which I couldn't find how to kill.

Modifications to the interface: colType() functions, though I left the old integer() functions, too.

mip_test file went to mip_demo.

Still not final.

Sorry, mistake

MIP support added (by Jano, the Great).

Even better...

Some documentation got changed.

reference to modules added

Minor comment added.

Some updates and restructuring

glemon is in a separate repository.

Using fixed bipartite graph

Bug fix in MinCostMaxBipartiteMatching
The augmenting phase have not changed the
unreached nodes' potential which caused invalid
dual solution in some cases

Must have been changed because of the private copy constructor.

... and fix another one.

... and fix a stupid bug.

(Hopefully) finish privatizing the copy constr. and operator= in
the graph concept, ListGraph and SmartGraph.

New, less general installation instructions.

Resolving: Bug #51

Resolving: Bug #52

- Disable the copy constructor and operator= of {List|Smart}[U]Graph.
- Improve graph doc
- Also put private members into the doc (if they are documented)

Do not install the documentation if configure was called with --disable-doc.

Renameing file: graph_component.h => graph_components.h

Removed references to the gui.

Use sed instead of rpl

Minor doc improvements

README version one is added.

Modifications in the Graph Component concepts

As we agreed, Node/Edge::operator<() is required by the concept

Distribute Makefiles.

Distribute Doxyfile.in and lemon.pc.in.

- Revised "Concepts" group documentation
- Other minor doc improvements

Revert splitted files

Splitted graph files

new snapshot

Some modification in the documentation.

Make explicit constructors

Removing concepts for extendable and erasable graphs
Renaming StaticGraph to Graph

Smaller Simple Bucket Heap
- the list node does not store the value
- trade off: linear time operator[]

Set svn:ignore property.

Single makefile.

Added reserveNode function.

Set props.

Moved the po directory to glemon/trunk.

Moved the gui to glemon/trunk.

Exclude the gui from the build.

Slight changes in doc.

Improvement:

The item sets are written in the order sorted by the labels.

It solves the problem if we read a graph from a file and
then write it back then the nodes will be reversed.
It can be switched off with the LemonWriter interface.

Doc bug fix

readed => read

benchmark: radix_sort-bench was not compiled

Bug fix in the list bipartite undirected graph

Gettext is needed for bootstrapping.

Bug fix

Bugfix