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

Spellcheck

Erasing some code from the examples

Erasing unused parameter names
Omitting Warning

Functor usage for writeable map adaptors
Documentation for writeable map adaptors

Docfix

SimpleBucketHeap added

It does not supports erasing, decreasing, increasing.
It contains single linked lists

It can be used to store levels for push-relabel algorithms

Fix Bug #45: Missing include

DirUGraphAdaptor documentation

Polinomial template class

Bug fix by Jano

Documentation improvements

Rearrangements:
IO modules
Algorithms

New documentation:
SwapBpUGraphAdaptor

Demos:
strongly_connected_orientation.cc

Benchmarks:
swap_bipartite_bench.cc

Writing only not empty sections

Bug fix

New demo file for computing disjoint paths

Doc review
Correcting misformatting in adaptors
Adding header to demos

Bug fix

Remade SplitGraphAdaptor

Revised Compile Time Arithmetic

Two state Variant
+ Some Compile Time arithmetic

Extenders modified

UGraphBaseExtender => UndirGraphExtender
BpUGraphBaseExtender merged into BpUGraphExtender

Fixed typos.

Bug fix

Do not delete the not constructed map

- fix bug #43: static and const in Tolerance class
- fix return value of nonZero()

Create a separate group for matrices

Also install .gif files.

Getting Negative Cycle

Bug fix: Using set instead reference assignment

gLEMON does not compile with gtkmm 2.4.x

Tabu Search by Szabadkai Mark

added scrollbars to the canvas

filter loop edges

Bug fix in findUEdge

id->label

Also check mingw compatibility

Bug fix

Add missing function

Images into the algorithm groups

Doc fix

Refinements in bipartite matching algorithms

added missing glibc2.m4

downgrade to gettext 0.14.2

po update

bugfix

distribute m4/*.m4

some reorganization

MaxWeightedBipartiteMatching
MinCostMaxBipartiteMatching

Both algorithms are based on successive shortest
path algorithm with dijkstra shortest path
finding

Changing the mining of the clear in heaps
It does not touch the heap cross ref. It is
sometimes more clean useable and more efficient

bugfix

make distcheck should work now

Removed a 0x00 byte which confused the file utility.

more explicit :)

path.h: bugfix, returning reference to a temporary

svn:ignore

revert to single configure scheme

New Algorithm group for matchings

LaTeX formulas
Bug fix => ///\f$ will cause parsing error in doxygen

Forgotten functions in the graph adaptor extenders.

Bipartite Graph Max Cardinality Matching (Hopcroft-Karp)
Test for it

Some BpUgraph improvments

Commiting The DynamicAsymMatrixMap from Nagy Jano
+ MatrixMapTraits

LinearHeap is renamed to BucketHeap which is more conform
and widely used name for this data structure

Doxygen log corrections

doc of ResGraphAdaptor has a bug in graph_adaptor.h

The algorithm does not change the capacity and the flow in the resgraph

More mingw compatibility

Implementation of the drand48 functions

Edmonds-Karp MaxFlow
ResGraphAdaptor with Tolerance

Small corrections

Writeable extension of some maps

Correcting the structure of the graph's and adaptor's map.
The template assign operators and map iterators can be used for adaptors also.

Some bugfix in the adaptors

New class SwapBpUGraphAdaptor which swaps the two nodeset of the graph.

Naming convention fix

Count ANodes-BNodes

MinGW32 compatibility

MinGW compatibility fix

NaN checking to be conform to MinGW32

Bugfix in the minimum cost arborescence algorithm
Dual solution computation and interface for algorithm
Optimality test on random graph

tolerance class incorporated

Unionfind changes induced some bugs here. Also some augmentations made.

docfix

IncEdgeIt goes through on loop edges twice.

Rewritten countItems and findEdges

Adding todo to preflow
Some naming convention renamings

missing ignore

Minimum Cost Arborescence algorithm

Doc rearrangement
Section readers moved to own group

bootstrap: quiet option

ignore generated files

include fixes

- added gettext infrastructure to the gui
- the gui has a separate configure script now
- other minor changes

Renaming files

unused parameters fix

rethrow fix

"Node shapes" added

Also check gcc-4.1

Spellcheck

unionfind_test: double erase is not supported anymore

UnionFindEnum: one remaining bug; removing commented out code

UnionFindEnum revision:

* 0 is _not_ convertible to list<...>::iterator, so we have to use other means
to define/check validity
* standard LEMON iterator interface for ClassIt and ItemIt

Omitting warning

Removing obsolote "id" map handling
Error message is modified

Checking missing section reader

Clarifing alteration observing system
It is directly connected now to a container

Bugfix in the hyper map

Bugfix: an ugly artefact of the 'id' -> 'label' renaming

Some documentation arrangement modification

Bugfix in bpugraph

bugfix: moving "invalid.h" down to "bits" broke autoconf

utility, invalid and traits moved to bits

UNDIRGRAPH_TYPEDEFS => UGRAPH_TYPEDEFS

The graph adadptors can be alteration observed.
In most cases it uses the adapted graph alteration notifiers.
Only special case is now the UndirGraphAdaptor, where
we have to proxy the signals from the graph.

The SubBidirGraphAdaptor is removed, because it doest not
gives more feature than the EdgeSubGraphAdaptor<UndirGraphAdaptor<Graph>>.

The ResGraphAdaptor is based on this composition.

Some classes assumed that the GraphMaps should be inherited
from an ObserverBase. These classes parents replaced with
DefaultMap which cause that the graph maps should not be
inherited from the ObserverBase.

Traits for alteration notifiers
SplitGraph is temporarly deleted

Bug fix

Default constructor which allocates empty graphs

An additional simplier interface for static size graphs.
Node operator()(int) for getting node by index
int index(Node node) for getting index by node

Bug fix

Bug fix

Bugfix

ListBpUGraph

Little bugfixes, spellchecks and improvements

Renaming to be convient to the naming of the adaptors
Concept checking of the ugraph adaptors

Mergeing extendermerge branch
Changes:
the extender system
resize for static size graph
UGraphExtender => UndirectGraphExtender
UGraphExtenders with changed meaning
Some UGraphExtender /SubUGraphExtenders, DirectUGraphExtender/
GridGraph => GridUGraph
radix sort to ansi compatible

vmap.h: Enables one to create maps with a virtual base class.

RefPtr: a reference counted pointer class

Fix bug #26: Check if an edge is a loop and do not draw then

Second renaming of min cut

Minimum => Min
Work => Aux

Public data members of xy became documented

Spellchecking

Dewarningification

- RGB color related stuff is in color.h now
- eps.h: A simple class to create .eps figures (demo: eps_demo.h)

Doc changes

One more step towards Undir -> U conversion...

Name modification

New algorithm:
MaxCardinalitySearch
MinimalCut // in UGraph

Easier checking in DEBUG mode

I hope we should not test ArrayMap longer

The vector map checks its limits in debug mode what
helps us to find the bad memory accesses in the maps

Compilation with G++ -ansi

Bug fix

Bug fix

Bug fixes in ListEdgeSet
Added SmartEdgeSet

Bug fix

- Increased max. number of iteration
- Better tests.

Spellcheck

- svn lock doesn't work
- fix bootstrap switch

Last struggle against Doxygen.

Unified copyright notices

Change the compilation flag at release make distcheck.
(This setting is probably indifferent, though.)

Minor change.

Polish the doc.

graph_adaptor.h: spacing corrections in doc

graph_adaptor.h: probably a doxygen bug: in tex formulas there should be
whitespace after the opening and before the closing \f$

lp_cplex.cc: bugfix in _setColName, _getColName implemented

Fight with Doxygen.
Victory hasn't been reached yet, but it's on the horizon.

Hopefully we can release 0.5 today

minor changes

- workaround for a Doxygen 1.4.6 bug
- other doc fixes

NEWS: major changes since 0.4 added

Use short icpc paths

Fix crash when an arrow is clicked with the delete tool.

kruskal.h: an overloaded function for older, pointer-style iterators

The version tag of the trunk is svn-head

- also works off-line
- icc-8.0 in (not) tested, as well.

Towards icc-8.0 compatibility...

Fix g++-3.4 executable's name

Some useful scripts:
check-compiler: test whether the repo compiles warningless
with various compilers.
check-integrity: checks whether everything is svn-added,
the makefiles are correct etc.
release: creates a version numbered release. Is modifies the repository.
DO NOT PLAY WITH IT!

Fix icc compilation failures.

Spellcheck

Bug fix

ANodeIt/BNodeIt should not be inherited from ANode/BNode

The reason:
assert(graph.id(ANodeIt(graph)) == graph.id((Node)ANodeIt(graph)));

Revising the bpugraph concept

We need a public but very limited ANode and BNode class
It can be used with ItemSetTraits and with some special maps

By example:
DescriptorMap<Graph, ANode>
InvertableMap<Graph, ANode, string>
IterableBoolMap<Graph, ANode>
IterableIntMap<Graph, ANode>
IterableValueMap<Graph, ANode, string>

Bug fix
friend does not declares type

New iterable map with comparable values
it uses linked lists and balanced binary tree

IterableBoolMap has ItemIt type as the other iterable maps

InvertableMap got ValueIterator

Solve bug #23: Floating versus Integer Coordinates

- BoundingBox values rounds to integer
- The generated .eps rescales if the bounding box were too small otherwise.

Better doc.

Use [] instead of set().

Functions added to set the edges/corners of the bounding box directly.

Do not rely on the autodetection of cplex and glpk.

Updated rpm specfile to include the gui too. Couldn't test it.

ignore radix_sort-bench

distribute simann.h too

Undir -> U transition

test for simann

added simann_maxcut_demo

demo for simann

more doc

include the gui in the deb

make public the shiftedStart inorder to compute just n dijkstra

Add new ItemSetTraits for ANode and BNode

Doc bug fix

Making iterable bool map dynamic
Changed interface

Algorithms by szakall

The pre BpUGraph concept

Bipartite => Bp
Upper => A
Lower => B

+ some bug fix

Undir -> U transition

Better doc.

MALE and FEMALE node shape added.

Omitting warnings

Do not append -Wall -W to CXXFLAGS when it is set on the commandline.

Bug fix for empty intervall sorting

Bug fix

state setting function for heaps

If we know that which elements were in the heap then
we can clear it in better time complexity.

Lemon Graph Format uses label instead of id named map.

Fix bug #18: bug in LpSolverBase::Col operator!= and ::Row operator!=

- setCol() -> col()
- better doc.

- tolerance() added.
- better doc.

Tolerance<long double> added

Documentation of classes realizing algorithm running.

- colName() added (untested on CPLEX)
- possibility to set lower/upper bounds of several cols at once
- setObj() -> obj()
- setRow() -> row()

Changes in doc

Documenatation of MapWin.

Documentation of MapSelector. If no default value is present in MapSelector, Reset button does not appear.

Documentation of NoteBookTab. Redundant function parameters are removed from other classes as well.

Documentation of NewMapWin.