The case when the objective function contains a const component is handled
correctly.

Demo prog that computes the max flow by LP

No output messages by default

lin_expr.h removed

Cplex interface has improved a lot.

Sample file completed: works correctly and the code is very beautiful. I love LEMON.

- XMap and YMap added
- Spell checking

Makefile has changed.

A sample file.

New functions in lp_glpk.cc. Sample file: lp_sample.cc.

LpSolverSkeleton -> LpSkeleton
lp_solver_skeleton* -> lp_skeleton*

max() [_setMax()], min() [_setMin()], primalValue() [_getPrimalValue()] added

Removing sticky using namespace std.
Making up the using of namespaces.

make distcheck works again

lp_test added
WARNING: Overall glpk dependency! (we should avoid)

Applied the changes which somehow vanished during my last merge. Thanks goes
to Marci for noticing this. In detail:
- added amsmath and amssymb latex packages for latex documentation
- src/demo is also scanned for doxygen input files

Stuffs moved into bits

make distcheck fixes. Anyway it still doesn't work.

- moved lp_base.h, lp_base.cc, lp_glpk.h, lp_glpk.cc, lp_solver_skeleton.h and
lp_solver_skeleton.cc to src/lemon
- modified the includes

Merged my branch (branches/akos) changes r1654:1740 into the trunk.

SolutionStatus -> SolveExitStatus
SolutionType -> SolutionStatus

Subdirectory for low level headers

Graph displayer displays graphs now.

Trivial bugfix

Started cplex low level interface.

Now one can solve an lp problem.

Bug fix.

dimacs_to_lgf demo
may we need a tools directory?

- Modifications to compile with *both* gcc-3.3 and gcc-3.4
- Adjust further SolutionType

Documentation of abstract functions is in lp_solver_skeleton.h

- Make lp stuff compilable
- Some 'set's removed

Options for debugging.

Conceptions and bug fixes.

To run graph-displayer with sample input, type make run, but do not move the nodes, YET

Graph displayer is now displaying nodes. Edges remain still undisplayed yet.

Graph displayer is now displaying nodes. Edges remain still undisplayed yet.

New groups called io_group and dimacs_group added

Peter is able to read xy vector from file.

corrections in docs

SmartGraph can also split() a node!

getPath() added to Bfs/Dfs/Dijkstra.

length() returns int istead of size_t

- split() added

It works again

LpSolverBase::Expr is documented

Correct MapBase usage.

XY reading is being wrote.

latex documentation for TightEdgeFilterMap, including amsmath and amssymb latex
packages for latex documentation

Minor improvements

some small corrections in docs

- Better (but still incomplete) doc
- lp_test runs correctly

- Non-template expressions and constraints (lin_expr.h isn't used)

Some bug fix

bugfixes in doc

bug fix in SubBidirGraphWrapper::firstIn(Edge&,const Node&), due to Gabor Retvari

Use the standard idMap

First version of iterable maps.

corrections in docs

zsuzska's own work directory

Constraints (expressions containing <= or >=) can be passed to addRow()
and setRow()

- LpGlpk added to the makefile
- missing const_cast<>() added
- prop for two new functions (solve() and solution())

This was a bug, I guess

Low level interface for GLPK (Marci ut?n szabadon)

(none)

- Largely extended linear expressions
- Better docs

- setRow() added
- more docs

- several missing 'const' added
- value of xy is undefined by default

- src/lemon/utility.h: dummy<> template added
- LpSolverBase::INF is now really defined
- AddColSet() to add several column at once
- using enable_if
- with some doxygen hack
- More doc improvements
- Better Makefile

Oops...

- lp_solver_skeleton.h/cc: skeleton for actual lp implenetations
- lp_test.cc: test file
- updated Makefile

- simple makefile added
- _FixId class added (more clarification needed)
- LinExpr class added
- some higher level interfaces added to LpSolverBase
- minor corrections

documentation

Bug fix (thanks to Misi).

"unused parameter" warning solved

An alternative of lp_base.h.

Bug fix in lp_base.h.

Completions.

Csak a te kedvedert.

Added.

(none)

Ami f?lig van k?sz, ma m?r f?lig marad...

small improvment in documentation

Modified a bit.

Copied only so far.

DO NOT USE UNDECARED STUFF

(correctly) ignore distro files.

Constructor of IdMap<G,I>::InverseMap made public

Some more MS VC++ compatibility changes (suggested by Janos Tapolcai)

For cygwin compatibility.

Several changes in order to compile with gcc-3.4

Several serious bugs fixed

svn:ignore *.exe (for ms systems)

svn:ignore fix

Fixes for MS VC++ (contributed by Janos Tapolcai)

Bugfix, thanks to Janos.

A strange compilation failure (under cygwin) is fixed.
Version 0.3 should be fixed as well.

- A primitive function type interface for Preflow.
- A compilation bug fixed

Minor changes for educational purposes.
(Much more would be necessary...)

Magic anyangle is Faster, harder, Blumchen

Magic triangle is a bit more DONE, and is already not only a triangle.

MapFunctor is made an STL standard compliant functor.

The first step toward function type interface to Preflow alg:
- Naming changed to be closer in style to the BFD/DFS/Dijkstra triplet.

Magic triangle is READY.

- Add compilation tests for the function type interface of BFS/DFS/Dijkstra
- Fix the bugs covered up by these tests

ForkMap and CombineMap added.

- Several updates and clarifications on dijkstra.h
- bfs.h and dfs.h is synchronized with dijkstra.h

Missing header file added

Missing input file added

- '.lgf' could be the standard 'lemon graph format' extension.
- heap_test is fixed in order that 'make discheck' work.
- heap_test now checks whether the input file exists.

Changing exception names.
Compile sentry fix.

Solve conflict.

i am getting familiar with gtkmm and gnomecanvasmm

Bug fix.

work modifications

Fix a bug noticed by deba.

Easy input-output function for common graphs.
Modified Exception handling in graph_reader.

ExceptionMember helper class.
Modified DataFormatError
IOLogicError

Increase test
Changing test graph

Bug fix in radix heap.

Minor doc changes

Nothing special

- rot90() and rot270() added to xy.h
- graph_to_eps.h's own rot() func. replaced to this

Bugfix in DijkstraWizard

Doc improvements

Missing #ifndef-#define

Bugfix in BidirGraphWrapper

let's remember: the boss said that we have to test even the non-working codes

- Bugfix in setting the previous Node
- Bugfix in DijkstraWizard _source member initialization

The source node is reported to be reaches but it has no previous node/edge.

Change test to be up to date.
Deprecated test, it should be used rather the heap_test.cc and heap_test.h.

Bug fix, and g++ 3.4 compatibility changes.

Adding GraphEdgeSet and GraphNodeSet classes to graph_utils.h.

Correcting explicit declaration.

Bug fix

Bug fix

Fix documentation.
Temporarly removing the exception handling.

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.