concept and checking functions for heaps

Radix heap_implementation

make constructors explicit

Corrected an error (dicussed with marci)

Some more documentation (sorry, I forgot to check the doxygen.log and now I am under windows)

Added two demo programs: of course they are not considered to be complete or finished in any sense.

Some work has been done in the quicktour.

Better color to bw conversion

Changing to gtk-mm

- ColorSet become commonly usable
- Possility to change the color of a node text (in GraphToEps).

Fix 'make distcheck' failure.

glpk is able to search 5x5 magic square, let's celebrate the free software

Everithing is half-done, but some progress has been made in writing documentation.

just kidding

Modified a little: I know that it is not consistent and plan to correct soon.

graphwrapper dox. everybody is asked to read doxygen.log

Experimental autopackage specfile.

Fix Doxyfile and the wrong hyperlinks in the doc.

Started to change documentation with excellent new ideas!!!

Corrected spelling errors.

Corrected spelling errors.

one more minor change

some minor changes, docs, etc.

A year has passed again.

Let's go on!

New features in v0.3

Better doc

We have UndirGraph, so BidirGraph has been removed.

svn:ignore change on src/demo

Graph and UndirGraph concept modifications.

* For incidence iterators ({In,Out,Inc}EdgeIt) there is now baseNode and
runningNode functions in graph interface
* For Edge in undir graphs: Edge(UndirGraph const &, UndirEdge, Node)
constructor. Same for IncEdgeIt
* Edge(UndirEdge, bool) constructor is no more in the public interface. (But we
need it in the developpers interface).

lemon/error.h: boost::shared_ptr helyett std::auto_ptr
(Sokkal kenylemetlenebb, es nem teljesen biztos, hogy helyes megoldas)

Wrap long lines

- Better addSource()
- More docs

Description of the LEMON directories.

if you have a nuclear power plant and wanna compute small magic squares, then let's do it

small changes

Several changes in the docs.

Minor changes.

A bit better msg.

Test the new dijkstra features.

Make Makefile.am up-to-date (as usual).

Doc improvements.

more docs

trying to add constraints of kind 1 <= x[2]+x[3] <= 4

The pair of setSomeThing function is getSomeThing.

more docs

This is not ready yet, but I have to go home...

Removing from work.

Changing first to iterators.

Fix wrong reference in the documentation.

IO moved to lemon.

Graph documentation

Removing graph_defines.h

Documentation

Documentation

Revised dijkstra.h with several new features added.

The new dijkstra.h comes in the next commit.

- PredNodeMap is a NullMap by default
- Execution with stop condition
- Find shortest path between two nodes

error.h added

Several important changes:
- Named parameters for setting ReachedMap
- run() is separated into initialization and processing phase
- It is possible to run Dijkstra from multiple sources
- It is possible to stop the execution when a destination is reached.

Document state_enum

Oops.

A new exception class called UninitializedParameter.

Dijkstra documentation is getting ready, but one decision is missing about naming conventions about named_params

Documentation is developing itself, but is not ready yet.

New error.h moved to lemon/

Obsolete error.h removed

Latest LEMON exception and assert concepts

Two incomplete additions:
- Exceptions
- bool map indication reached nodes (NullMap by default)

Minor changes.

Bugfix

- More or less follows the new naming convetions
- New implementation for dijkstra();

Some changes in the IO and map utilities.

Tutorial for graph input - output

correction

try of grouping for documentation

lower and upper bound handling functions for rows

new functions for changing lower and upper bounds of variables

- Fix missing file (max_matching.h)

- '%%Title:', '%%Copyright:' and '%%CreationDate:' fields added to graphToEps-
generated output
- Some more checks in configure.ac

- Node shapes are shown in the doc.
- The generated PS file is closer to be DSC conform.

Concept modification to resolve the item by its ID.

One more trial/approach for named params (Under constr.)

small changes, a try for max flow using expression

Add a 'scaleToA4()' function.

Functions to query height/width of a BoundingBox.

Wrap a long line

- Some things to do.

-=, - operators in expressions

(none)

A proposal or test implementation for linear expression`

Various changes.

Removed some unnecessary files.

(none)

Adding a function which returns the mate of a node.

following the changes of max_matching.h

Now, the actual drawing is made by run() instead of the destructor.

resetPos deleted

- Nodes are drawn in a better way
- Arrowheads made more similar in parallel vs. non-parallel modes.

One more node-shape added.

Correct bad arrow enpoint when parallel edges are enabled.

In graphToEps(), nodes may have different shapes (circles or squares).

- Parallel edges look a bit better
- Possibility to insert verbatim PS blocks for each node

Functions added to compute the gradient of Bezier curve.

Doc improvements

findEdge bugfix.

more precise distinction 'tween low and high level lp interfaces

Changes in doc.

Serious buxfig in findEdge()

Edmonds max_matching.h tester

Edmonds matching alg

functor->map and map->functor converters added.