for_each_macros.h in include

misc

for_eachmacros.h in include

for_each_macros.h in include

(none)

Started mincostflow.

Another slight modifications.

Slight modifications.

undir -> dir in docs

Almost full documentation added, NO_FLOW incorporated, Phase0(1) changed to Phase1(2)

I modified mincostflows_test.cc a little.

max_flow interface changes

Slight modification.

(none)

:wq

(none)

bugs

(none)

(none)

BidirGraphWrapper<Graph> bug volt

(none)

path improvements

#include <hugo/...>

bip matching comparison

include -> hugo mods in leda files

docs, max_flow improvments

Minor changes: Section labels fixed.

documentation of bipartite matchings, cleaning

BidirGraph, UndirGraph some docs, in group graphs

Some modifications and another testfile.

Sorry, the other half of the move comes here.

misc

Moved things into the include (hugo) directory.

Finished MinLengthPaths: a specialization of MinCostFlows.

docs

docs

some docs

I completed the description of the coding style.

bfs_iterator -> bfs_dfs.h, some docs

That's what I wanted.

(none)

Bocs, veletlen volt.

complete graphs

bfs, dfs docs

Added full_graph.h to the installable headers.

(none)

Spell check.

comleteGraph

The file src/work/alpar/fullgraph.h renamed and moved to src/hugo/full_graph.h.
Compilation tests for FullGraph added to src/test/graph_test.h.

FullGraph class.

Changes in the Maps' copy constructors.

doc

felkesz tesztprogi

They go to /dev/null.

doc

Some more test cases.

Some new typedefs.

From now on 'work in progress' files are not in /doc/Doxyfile.
The new src/work/Doxyfile containes these as well.

aprosagok

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

Some docu in MaxFlow class, jacint/max_flow.h

Move unionfind.h in Doxyfile too

UnionFind moved to include. Test compiles and runs cleanly.

* test/makefile:
minor cleanups

corrections for leda matching files

Three new methods in UnionFindEnum.
UnionFindEnum completed.

corrections

Main page added.

preflow.f -> max_flow.h

doc

preflow, maxflow

edmonds_karp_demo->max_flow_demo

edmonds_karp

ledagraph

preflow, maxflow

misc

Comparison == changed to <=

const-ok

nem irunk olyat hogy "void resetTarget(const Node _t) {t=_t;}" mert az a const az ott jobbara hulyeseg

preflow maxflow ...

preflow, maxflow comp

mods implied by preflow mods

It breaks my heart to say them goodbye...

doc

Doc for the union-find structures.

bug ellen

test makefile hiba

dijstra const ref, misc

Docs.

\author's added

Doxygen options changed.
\author's added.

for checking bipartiteness

makefile: nem veletlenul commit-oltam

(none)

(none)

Changes in the interface and new test program added.

trifles

debug

bfs, dfs, bfsiterator, dfsiterator for alpar's sake of being much more standardized.

misc

comparison for matchings with leda

Egy helyes (warning nelkuli) megvalositasa az operator<< -nek az stGraphWrapper
Node es Edge-enek. Csak a konverziok es templates fuggvenyek "alacsony
prioritasa" miatt hasznalhatatlan.

Magyarul az stGW::Node -ra jol mukodik, de a NodeIt-ra mar nem, pedig van hozza
konverzio. Csak akkor mar inkabb a ListGraph::Node-jara definialt nem
template-es fuggvenyt hasznalja.

debug

* list_graph.h:
- node_item and edge_item are structs and not classes
- operator<< is inline

oops

makefile improvement in work/jacint

doc trimming.

makefile

The long description is now the description of the module.

Testing preprocess.

gcc-3.4.0

misc

Some more docs.
DirPath::Builder::setFist() added. (It is empty.)

g++-3.4.0, misc

xy.h went to src/include.

docs

Many new modules (groups) in the documentation.

Path of time_measure.h fixed.

time_measure.h went to src/include.

Minor doc corrections

Some more tests.

Some more docs.
Put it into the 'misc' group.

'misc' group added to the documentation

misc

macro erase

For working with undirected graphs, head is changed to aNode.
Some dimacs doki.

leda comparison files

comparison with leda algorithms, wrapper for leda graphs

misc

Better control of gcc version