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

dim_to_lgf has been moved to tools/ (from demo/)

The lemon repository has been renamed

An improved version of ArgParser: You don't need to give an explicit storage
for each option.
TODO: Documentation must be updated

Data hiding
Const members

Steiner 2-approximation demo

More query functions

Little interface improvment

Some design correction

naming convention:
header sentry

Correction of urls and email addresses

Bug fix missing include

Bug fix
from Kovacs Peter

Bug whit Parent typedef in SplitGraphAdaptor::CombinedEdgeMap
Fixing graph to eps parameters for demo

Happy New Year to all source files!

- '-Wshadow' seemed to strict therefore removed
- a tools directory added for useful executables codes
- tools/lgf-gen.cc (a random graph generator) added

arg_parser.h: A command line argument parser.
dist_log.h: A tool for measuring one and two dimensional distributions.

More doc.

Fix icc compilation failures

Hard Warning checking
- based on the remark of the ZIB user
- we do not use -Winline

Bug fix
Setting _pred in init()

getNotifier to notifier renaming

steiner.h into the makefile

2-approximation of Steiner-tree problem

Bug fix

ball2() -> disc() renaming

Prescaling can be turned off

Once again minor doc changes

Minor changes

Reorganization of the modules and groups

A preflow based general network circulation algorithm and a simple demo

Some two dimensional random distribution added.
They should be revised.

Doc improvements

Adding original license to the file
+ buffered bit generation

Minor fix

Some documentation changes

Naming convention changes

setObj => obj
is_min => isMin
is_max => isMax

Bug fixes
Documentation

More adequate doc.

Using const in lp interface
colByName functionality

Check Soplex support, as well

Lp row and col getter function
lp section reader and writer for lemon IO

Changes on the LP interface

_FixId => LpId
- handling of not common ids // soplex
LpGlpk row and col erase bug fix
- calling lpx_std_basis before simplex
LpSoplex
- added getter functions
- better m4 file
- integration to the tests
- better handling of unsolved lps

Small changes

Implemented virtual functions of class LpCplex.

Lagrange relaxation based algorithm for the delay constrained least cost
path problem.

Some spellcheck

Dijkstra could return the temporarly distance of the current node

Some bug fix
RevIt => RevEdgeIt renaming

Further doc improvements

Two new distributions added:
- Gaussian distribution generated using the polar form of the Box-Muller
transformation,
- Exponential distribution generated using inverse cdf.

Doc improvements

A push/relabel type max cardinality matching implementation.
(slightly incompatible with bipartite_matching.h)

Doc improvements

Correction of the wrong base class

Several doc improvements.

Small bug corrected.

- Some bugfixes
- Better doc
- liftToTop(), liftTo() added

Spellcheck

elevator.h: A class for handling item labels in push-relabel type algorithms

One important thing only: equality-type constraint can now be added to an lp. The prettyPrint functions are not too pretty yet, I accept.

Bug fix

G++-3.3 conform solution

Bug fix

Undirected minimum cut benchmarking

Make Hao-Orlin epsilon-safe

Bug fix

Changing implementation of undirected graphs
slightly faster, 10% speed-up

Adding two heuristics
Based on:
http://www.avglab.com/andrew/pub/neci-tr-96-132.ps

Nothing serious.

New path concept and path structures

TODO: BellmanFord::negativeCycle()

I only corrected some errors in the documentation.

MACROS for debug map usage

Bug fix

Easier inverse than m.inverse()[a] => m(a)

Better handling of inexact computation.
We do not use tolerance for excess, just for edges

clone => build renaming

Query functions have been implemented for GLPK (CPLEX breaks at the moment, I guess): These functions include:
retrieving one element of the coeff. matrix
retrieving one element of the obj function
lower bd for a variable
upper bound for a variable
lower and upper bounds for a row (these can not be handled separately at the moment)
direction of the optimization (is_max() function)

More sophisticated warning messages.

Fix 'unused variable' warnings

Oops. I did not mean to break the repository.

Some query functions got implemented, but only for GLPK.

Check for gcc version 3.3, 3.4 and 4.0 as well

Send the output to /dev/null

Copy constructor for LpGlpk

Automatic doc generation from the SVN trunk

- Change the subjects of broken repository mail alerts.
- Do not send the log file to the list

Send broken repository alert also to lemon-commits@lemon.cs.elte.hu.

Put server services related scripts under the server-services folder.

Lp section reader

Configuration files for soplex

checking soplex

Preliminary soplex support

modified _setColCoeff and _setRowCoeff parameters
const simplify() for expressions

make 'commit-checker' silent

- update graph_oriantation.cc to be in line with the renamed xy and with the
new graphToEps() scaling.
- Fix and external directory build problem in Doxyfile.in

Make the constructors of ColIt public.

Erasing unionfind Item template parameter

Some doc fix

BfsVisitor
Bipartite partitions based on visitors

topology_demo.cc => scaleToA4 works without extra parameters

Keeping order of alteration observers

Removing some automatic callback generation
// exception safety reason

Doc fix.

ColIt added. (Untested, but at least it compiles.)

Test the automatic compilation checker 1/2: fix the repo again

Test the automatic compilation checker 1/2: make a bug

Conditional execution until the target is reached
/previous implementation: until the target is the next to process/

todo: query the target when we give nodemap as condition

Bugfix: didn't removed the lock file if something went wrong

Test the automatic compilation checker 3/3: fix repo again

Test the automatic compilation checker 2/3: wrong commit

Test the automatic compilation checker 1/3

Send message to the commit author, as well

Script for automatic checking of SVN commit's consistency

First implementation of the static graph class
It could be improved to get better running times on benchmarks

General mapping based variant type

Spellchecking

GraphCopy and UGraphCopy modifications
Preliminary support for static graphs
=> cloning graphs

Added BpUGraphCopy

Tests for graph copies

Strict checking disabled

Corrected some typos and grammatical errors.

Removing template Map template parameter from InvertableMaps

The implementation of the graph copy is changed
Make explicit more constructors

Bug fix

Renaming MinCut

Bug fix

Bug fixes

tutorial update
algorithms, and graph visualisation

One more refinement

Update scripts

update for version 0.6

icpc-9.0 compilation bugfix

Min cost flow is renamed to SspMinCostFlow

Small bugs in the documentation 2.

Turn off 32 bit only tests, cont'd.

Small bugs in the documentation.

Turn off 32 bit only tests.

repository cleanup

- Add an autopackage generator script for glpk
- update autopackage specfile

Bug fix for removing heap Item from template parameter list

ColName() -> colName(), Coeff() -> coeff()

LEMON_INTEGER -> INT

NEWS updated to Rel0.6 - according to Alpar's instruction, at last

NEWS updated to Rel0.6

A little test was born for Expr::simplify().

Bug #46 fixed: Superfluous template parameter in Heap concept
NOTE: Not every affected file tested.

concept -> concepts cont'd

Doc update

concept -> concepts (namespace & directory)

Spellcheck

Docfix.
maps.h is still very fuzzy.

Doc improvements.

Graph imlementations actually provide ReferenceMaps.

It have not been saved

Some improvements on item readers and writers

Remove superfluous #ifndef boundaries

A trial to make the last test platform independent.

Documentation for UndirGraphAdaptor

Compilation warning resolved.

Compilation warning resolved.

SimpleMap and SimpleWriteMap
- Trivial adaptors, but they are useful in some case

Some combined maps will be reference map if the first
template parameter map is reference map or not. If I want
to give a refernce map as first map but there is a non
reference map parameter then I should wrap my first map
to a regular read-write map.

Update the Path concept
Concept check for paths

DirPath renamed to Path
The interface updated to the new lemon interface
Make difference between the empty path and the path from one node
Builder interface have not been changed
// I wanted but there was not accordance about it

UPath is removed
It was a buggy implementation, it could not iterate on the
nodes in the right order
Right way to use undirected paths => path of edges in undirected graphs

The tests have been modified to the current implementation

Documentation is moved to source file

Little modification on interface and documentation

Benchmark the running time of lemon::Random

Change for better measurement very fast operations (enable a higher
number of iterations in runningTimeTest())

New random interface
Switching to the new interface

Improve build environment and scripts

Turn off 32bit specific tests.

Turn off 32bit specific tests.

Bugfix

Improve the configuration environment / repository layout:
- Update README
- svn-head -> svnhead version tag change (in favor of rpm build)
- rpmbuild-glpk: a script to build glpk rpm.

EdgeLookUp and AllEdgeLookUp tests added.

EdgeLookUp and AllEdgeLookUp added.

Minor change in 'make rpm' behaviour.

docfix

Fix a bug and two warnings

Some rearrangement of concepts and extenders
BpUGraph concepts and concept check test

Some doc fix

Mersenne Twister random number generator

The code is based on the official MT19937 implementation
It is fully rewritten:

http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html

todo: fixing copyright information

Improved documentation.

include just the existing solvers

MIP interface tested (and corrected) for cplex 9.0

Doc fix

Moving the file into correct group

Exporting interface to the Graph class
Some documentation improvements

findEdge extension also for the BpUGraphs
proper handling of loop edges in the UGraph::findUEdge

Minor changes.

Too many files added: sorry.

Missing cplex files: sorry.

Interface to the cplex MIP solver: it is little, a bit sour but it is ours.

Doc fix

The recent progresses on the tutorial due to Mark.

Fix another one external build problem.

Doc improvements

Some corrections.

Some small improvments

size() and subscription operators
compatibility with higher dimensions

Hao-Orlin algorithm

It is based on Attila's work
It is tested on all dimacs files in data directory

It may need more execution control
- possible interruption after each findNewSink

Add missing header sentry

Resolve 'unused variable' warning

Revert an unintentional commit in r2933

xy -> dim2::Point

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

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