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