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.

-=, - 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.

:-}

:-}

graph_to_eps mission accomplished.
- lemon/graph_to_eps.h header created
- lemon/bezier.h: Tools to compute with bezier curves (unclean and undocumented
interface, used internally by graph_to_eps.h)
- demo/graph_to_eps_demo.cc: a simple demo for lemon/graph_to_eps.h

Fix 'make install' failure.

Missing 'xy<T> operator*(double, xy<T>)' added.

ShiftMap and ScaleMap added

- Minor correction in time_measure.h
- A bit more meaningful test in time_measure_test.cc

(none)

Advances in error.h

* More clear exception usage concept
* sketch of LEMON_ASSERT interface
* test file

src/work/Doxyfile: Minor changes

* include \internal documentation
* input whole directories: marci, alpar, deba, klao
* sync to doc/Doxyfile

update to doxygen v1.4.0

Doxyfile: minor changes

Doxyfile updated to doxygen v1.4.0

- Parallel edge support (without arrowheads)
- Texts on the nodes

- Empty doxygen comments
- sconst -> const

Nasty bug in undir_graph_extender.h

(none)

undirgrafbug

undirgrafbug

Exception hierarchy sketch.
Exception safe exception classes.

graphToEps also accepts an output file name parameter.

countUndirEdges bugs fixed

UndirGraphs: invalid edge bug

Two examples showing a bit more convenient way to implement named parameters.

graphToEps is now able to write to any ostream.

Several new named parameters and documentation added to graphToEps().

Conversion constructor added

minor changes for various number types

Bugfix

An experimental graph-to-eps exporter.

Several new member functions added to BoundingBox

- Missing 'const' keywords added
- Stupid implementation of 'AbsMap' has been corrected.

Several changes in doc

Serious bugfix in WriteMap<K,T>::Constraints

- Several convenience maps added to maps.h
- Improvements in doc

AlterationObserverRegistry -> AlterationNotifier
third step

AlterationObserverRegistry -> AlterationNotifier
2 step

Renaming AlterationObserverRegistry -> AlterationNotifier
first step

graph_io under construction
This is a working version, but needs more improvments.

todo:
documention + fix the file format
improve the exception system

add some possible asserts

tutorials

reader under construction

Make UndirListGraph and UndirSmartGraph visible in the doc.

Undir list and smart graph

bug fix

GraphReader under construction
InversableMap

:-(

Undirected graph documentation and concept refinements.

* quite a few bug fixes
* concept::UndirGraph is almost complete and looks quite good.

GraphReader implementation ideas.
+ Question: Why we need common input interface?

:-)

bug fix. previously, it did not work with graphs having non-reference node-maps

More rational structure of classes in MergeGraphWrappers

MergeGraphWrapper bug fixes

Added this in order to prevent losing it.

Added a getCost() method to the Entity. Now prevCost() returns what its name suggests.

UndirGraph implementation nearly complete

Advances in UndirGraph.
* IterableExtender is complete

Fix Edmonds' name.

the old-style codes are removed from comment

Use lemon::Timer for time measuring. Added the threshold() function and initial threshold and temperature calculation.

Generalized flow by lp

bug fix in SubBidirGraphWrapper, roadmap to MergeGraphWrapper

RoadMap to more general flow algs.

Modifications for hugo 0.2

MergeGraphWrapper

ObserverRegistry base classed in SnapShot has changed to be protected

- snapshot-rollback functionarity added to ListGraph
- The iterface of the snapshot-rollback functionarity in SmartGraph has
changed to be compatible with ListGraph::SnapShot.

reverseEdge() and contract() member-functions added.

RoadMap to STGraphWrapper

RoadMap to MergeGraphWrapper and STGraphWrapper,
NewEdgeSetGraphWrapper which is similar to the old EdgeSet

MergeNodeGraphWrapper

(none)

- Timer class got direct access to the components of the ellapsed time/
- Better docs.

misc

commercial

MergeNodeGraphWrapper with factory

Named parameter tests

Some comments and minor additions to the AdvancedController.

Added a second SimAnn with the other controller.

ErasingFirstGraphWrapper

RevGraphWrapper modified according to the factory

Ops...

Unified style hyperlinks in the doc.

Matrix interface running time test...

error.h brought back to life

GraphWrapper changes for factory

- Move template.h to doc/.
- Insert the license terms into the documentation.
- template.h now appears under the coding style documentation.

An 'unused variable' warning when compiled with gcc-3.2.2 is removed

XyzConcept moved to Xyz::Constraints
use checkConcept in the next way:

checkConcept<ErasableGraph, ListGraph>();
checkConcept<ReadWriteMap<Node, Node>, PredMap>;

Revome an obsolete #include line.

Naming changes:
- ValueType -> Value
- KeyType -> Key
- ReferenceType ->Reference
- PointerType -> Pointer

Naming changes:
- head -> target
- tail -> source

Bugfixes in UndirFullGraphBase

Copy-Paste bug fix.

UndirFullGraphBase is added
It is a graph base which contains only one way directed edges in a full graph.

mappable_graph_extender.h erased

the map extenders are moved to the map implementation headers

maxUndirEdgeId modified to maxId(UndirEdge)
maxEdgeId modified to maxId(Edge)

maxNodeId() and maxEdgeId() changed to maxId(Node) and maxId(Edge)
getNodeObserverRegistry() and getEdgeObserverRegistry() changed to
getObserverRegistry(Node) and getObserverRegistry(Edge)

IdMappableGraphExtender erased

"make check" pass under icc v8.0

* There are _many_ remarks which are worth examinating! Non-inline (and even
not template) functions in header files for example.

"make check" pass under gcc-3.4.3

* enable_if imported from BOOST
* count{Nodes,Edges} implemented via graph tags
* some #include bugs fixed

A demonstration how to use _optional_ boolean tags.

for better compatibility with gcc-3.4

Changes in doc.

- Add makeSnapshot()/rollBack() functionality
- Remove an unnecessary #include

A graph reader interface proposal

remove an annoying warning

partial graph_wrapper changes with graph_factory

findEdge() declaration went to the right place (for the sake of Doxygen.)

Several changes in doc.

Several changes in doc.

Added an init method to the controller, and started writing a second controller.

Moved the includes to simann.h.

Doc improvements

Updated the makefile.

Undirect graph implementation.
Not yet done, untested.

* Somewhat less redundant and a bit more correct graph concepts.
* graph_wrapper_test does not compile

Renamed simann_test.cc to simann_demo.cc.

skeleton(s) -> concept renaming

Updated because of the recent changes in simann.h.

Now the controller asks SimAnnBase for the various costs.

Added the SimpleController class, and removed the first version of SimAnn in favour of the second.

Improve docs.

Improved docs.

- Named parameters and traits for Dijkstra
(in src/work/alpar/dijkstra.h to be swithced to src/lemon)
- doc/named-param.dox: Doxygen page for named parameters.

Traits + Named Parameters version

- SmallGraph is also a class instead of being a typedef.
(For the sake of doxygen.)

- Changes in doc (spell check).
- SmallGraph is a class instead of being a typedef. (For the sake of doxygen.)

ListGraph compilation bug fixed.

- moveHead() and moveTail() added. Not tested.

A new doxygen group added for graph utilities.

The graph_factory branch (@ 1321) has been merged to trunk.

Modify to compile with ++-style iterators.

It's time to design an iterable generic bfs

Bugfix. (removed forgotten "using namespace std")

Naming and coding style fixes and various other changes.

Suurballe and MinCostFlow classes are now able to increase the flow 1 by 1 with
this->augment()

Coding style.

- Change version 0.2 -> 0.3
- Doxyfile change for right #include< >'s (in Doxygen 1.9 only)

Many of ckeckCompileXYZ()'s are now in the corresponding skeleton headers.
(Tests for Symmetric Graphs are still to be moved)

Revert backport changes -r1230.

Some old comments

* Beautifying Makefile.am
* svn:ignore on "demo" dir

Added 'src/demo/Makefile.am'.

NodeSubGraphWrapper, test, and ducumentation modifications.

New EdgeSubGraphWrapper class specializing SubGraphWrapper in the way that only the edge-set can be filtered.

SubGraphWrapper code example, converter from dimacs to graphviz dot file.
The second one can be a tool for generating documentation of code examples.

documentation os SubGraphWrapper with code example.

mv after 0.2

Version 0.2 released.

minor correction

Cosmetic changes.

Use latin-1 encoding.

- Add myself
- Cosmetic changes

more docs

hugo -> lemon renaming leftovers

hugo -> lemon

some changes in the doc to make things clearer

- Backport -r1227 and -r1220
- Temporarily remove (move to attic) tight_edge_filter.h

Initial revision.

merge_node_graph_wrapper::nodemap

Fix InEdgeIt and OutEdgeIt in the symmetric graphs.

beginning of a modular, generic merge_graph_wrapper...

Bugfix. (unionfind segfaulted when compiled with icc)

mrproper rule bug

meself

Fix many doxygen command bugs.

minor corrections

New symmetric Graph concept.
New symmetric list and smart graph.
Symmetric Graph tests based on the Graph Tests.

added myself

I forgot to apply
for i in `ls *.h`; do rpl template.h $i $i; done
in src/hugo/attic

Copyright header added.

Some code cleaning in id related stuffs

Do not document registry and map defines.

Some commenticide was applied.

correction to 0.2

correction of HUGO_... preproc defines.

'iff' changed to 'if and only if'

Classes (and corresponting file names) renamed:
- MinLengthPaths -> Suurballe
- MinCostFlows -> MinCostFlow

Oops. I forgot to commit this at -r1204.

The default constructors are removed from the maps.
The ArrayMap is the map structure of the graphs.

- mincostflows.h renamed to min_cost_flows.h
- minlengthpaths.h renamed to min_length_paths.h
- src/test/old_path_test.cc removed

Minor correction to (preflow_graph.inp -> preflow_graph.dim)

todo for real comparison

Dox readable more even.

graph_wrappers now pass the tests.

template<typename CMap> Map(const CMap&) like constructors and
assigns are removed.

Specialized ConstMap for defining constant maps at compile time, by klao.
Time comparision of the generic and specialized maps.

EXAMPLE_PATH is set to the demo dir.

(none)

new test graph

(none)

Kruskal cleanup:
- resolved the NonConstMapWr bug
- docs added for NonConstMapWr and KruskalSequenceOut

Somebody forgot to remove these.

Put away debug.h and error.h temporarily.

This was forgotten to add from the previous commit.

Right (but still too short) documentation of the namespaces.

- Name changing: XYZGraphSkeleton -> XYZGraph
- Fix some bad \ref's in the doc.

An alert added to doc.

Graph wrapper tests added.

Fix maps in the GraphWrappers.

Go back to -r1169 in order to be able to compile minlengthpath_test.cc

Changed to conform to the new iterator style.

Document the file itself.

- GraphSkeleton renamed to ExtendableGraphSkeleton
- Use full explicit namespaces in some places in order to work with icc. (I don't know why they are necessary.)

Cross references turned off.

(none)

(none)

more docs

This is needed for the demo.

Demo file for SubGraphWrapper<Graph>. Documentation will be added later.
The purpose of this graph is to have an easy and short demo for the above class.

(none)

Sorry, the name chosen was a mistake.

(none)

An edge-map which shows the tight edges w.r.t a potential and an edge-distance function.

bug correction

bug correction in SubGraphWrapper<Graph>::NodeIt::NodeIt(...)

Completed documentation for mincostflows and minlengthpaths.

Forgotten std::
Apropos, why does it compile without it?