leda-hugo matching alg osszehasonlito

Property changes (some files was ignored).

EdgeSet is more or less working.

src/work/alpar/list_graph.h moved to /src/hugo.

top-sort, dimacs mods.

(none)

Docs added

*** empty log message ***

(none)

Edge opposite(const Edge&) in BidirGaphWrapper<Graph>

(none)

Compile checks added.

BidirGraphWrapper<Graph>, the map values are different for the opposite edges.

An alternative dijkstra_test.cc

time_measure.cc was renamed to time_measure_test.cc
Add an alternative dijsktra_test.cc

Exit with correct return value

ResGraphWrapper mods.

skeleton tests turned on again.

We need to distribute the headers in 'skeletons' too.

No automatic doc generation.

(none)

(none)

A max bipartite matching class in src/work/marci/max_bipartite_matching.h
which can be used for computing maximum cardinality ordinary matching, b-matching and capacitated b-matching.

random graph, random bipartite graph in jacint/graph_gen.h

(none)

graph_wrapper.h in hugo

#include <hugo/ > modifications

Method checkSolution() added.

SubGraphWrapper bug ok

top-sort, for fezso's sake

Written hugo/ into includes.

Some tests must have been commented out temporarily.

(none)

(none)

Modified a little bit

No automatic doc generation.

Test cases for time_measure.h

(none)

an experimental topsort

Set up automake environment.

(none)

(none)

Rename 'include' to 'hugo' (for automake)

(none)

Contains Edmonds' matching algorithm in a plain and in a heuristical form.

tests max_matching.h

(none)

primitive random graph generator

Minor bugfix.

Compiles also with icc.

Compiles with are icc, as well.

Minimum cost flows of small values: algorithm from Andras Frank's lecture notes (approximately)

Adding update() to NullMap

Able to read min cost flow, max flow, shortest path, matching testgraphs

Nem tudom, a hugo-n miert nem megy.

bool forward(Edge), bool backward(Edge)

misc

An undirected graph template UndirGraph<Graph> can be used.

Started.

Nothing special.

Ezt mintha mar toroltem volna.

Created minlengthpaths_test.cc. Compiles with: g++-3.0 -Wall -I. -I../{klao,jacint,marci} -I.. -I../../include minlengthpaths_test.cc -o min | & less

Putting things in their place

Started minlengthpaths_test, but it should not be here

Test file xy_test.cc finished. Really.

Test file xy_test.cc finished.

To be compatible with gcc-3.4.0 ...

An awful mistake found and corrected.

xy_test added: it was not entirely useless, I found a mistake in xy.h

bip matching...

getPath() function implemented.

matching, flows

(none)

docfix.

A "related pages" about Hugo Coding Style.
To be improved.

Now it sucks the whole src/include and src/include/skeletons
instead of individual files.

I changed it to correspond changing requirements

One more test case with minor importance.

test/graph_test.cc added.
It discovered several bugs and warnings in 'include/smart_graph.h',
in 'include/skeletons/graph.h' and in 'work/alpar/list_graph.h'.
They have also been fixed.

static const bool BipartiteGraphWrapper<Graph>::S_CLASS, T_CLASS

bipatite

misc

A bipartite graph template can be used as BipartiteGraph<ListGraph>.

bipartite graphs

bipartite graph in bipartite_graph_wrapper.h

gw

(none)

Felkesz kod!

DirPath fejlodes.
Kiserleti struktura a forditasi idoben kapcsolhato konzisztencia es range
ellenorzesekre.

spell checking

ingroup bug

The -W gcc option _does_ matter even if you use -Wall!
Minor changes.

Basic error handling facilities
(and possibly a g++-3.4.0 bug)

misc

some documentation

TODO