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?

Handling strings with std::string
Do not segfault if srcdir env. variable is not set.

docs changes

- Modifications to compile with icc.
- Remove some comments.

Better handling of the input files of the tests.

correction of SubGraphWrapper bug.

Change the name of a template parameter.

Remove obsolete features.

Changes in doc.

(none)

(none)

Set 'svn:ignore' property.

Set 'svn:ignore' property (again).

Set 'svn:ignore' property.

'make distcheck' works again\!

Bug fix in the symmetric maps.
Faster map initialization.
Iterators and Containers STL compatible.

Minor corrections. "make distclean" still doesn't work.

Fix a DANGEROUS bug.

Change the compilation order.

Change MaxFlow to Preflow.

Remove unnecessary include headers.

(none)

Reserve is resolved.

preflow last changes

Remove one remaining range checking.

There is no runtime debug in path.h

preflow test

Eliminating redundant lines.

The first version of new path test program. The old became old_path_test.

KeySet and ValueSet are inserted into the map structures.
They makes possible the iterating on the keys or values only.

... and add the missing header files.

- hugo/skeletons/path.h added.
- Obsolete XYZ_map_factory.h's removed.

Improve docs.

Spell checking (Ereasable ->Erasable), affected also the code.

Improved docs.

Shorter template parameter names to be more readable in Doxygen.

There was a little troublie with the true return statement

The MapFactories have been removed from the code because
if we use macros then they increases only the complexity.

The pair iterators of the maps are separeted from the maps.

Some macros and comments has been changed.

This is needed by path.h

path_test is getting under construction

path.h by Misi, committed by Peter. There is DirPath usw. in it.

Getting compilable with path_test

Some warining fix in maps.

default_map_factory.h was missing.

(none)

Improve docs.

- maxEdgeId() and maxNodeId() now works as their names suggest.
- maxEdgeId(), maxNodeId(), nodeNum() and edgeNum() are documented.

Spell checking.

Minor change (STL naming conv. differs from our).

Kruskal alg. (src/hugo/kruskal.h, src/test/kruskal_test.cc) is (almost) done.
- Some input adaptor is still missing.
- The class and function names should be revised.
- Docs still needs some improvement.

Spell checking.

Bug: This file must be updated.

Correction in doc: skeleton/path.h has been moved to the 'skeletons' module.

Minor changes in doc.

Changes in doc.

One more thing to do...

- Clarified Path skeleton.
- setStart() changed to setStartNode()

- Changes in doc
- setGraph(...) finally removed from Dijkstra, Bfs and Dfs.

- Changes in doc
- Some obsolete features has been removed.

Move general graph compilation tests to 'src/test/graph_test.h'.

(none)

(none)

Skeleton for paths.

INSTALL and COPYING are not generated files.

Put a lot of missing header files to src/hugo/Makefile.am

New doxygen module "skeletons" for the skeletons.

- BFD/DFS/Dijkstra compile test is done with skeleton::GraphSkeleton graph
and skeleton::ReadMap.
- 'skeleton::' is explicitely written instead of 'using namespace ...'
in graph_test.cc
- Output messages of type "makeRep(3)..." in unionfind_test.cc have been
changed in order not to confuse compiler output parsers.

Nicer and more documented graph_wrapper.h file.
These are only the first steps for making this file more beautiful.

Formatting: breaking long lines.

- 'minlengpaths_test.cc' added.
- Path tests in 'minlengpaths_test.cc' are swithced out.

.

mincostflow_test is ok.

Tests for the existence of 'KeyType' and 'ValueType' in the graph maps.

Change 'Key' to 'KeyType' (possibly temporarily).

Changes in doc. (New module name for array/vector maps added.)

dimacs.h

(none)

--This line, and those below, will be ignored--

A hugo/sym_map_factory.h
M hugo/list_graph.h
A hugo/array_map_factory.h
A hugo/map_registry.h
M hugo/smart_graph.h
A hugo/map_defines.h
A hugo/extended_pair.h
M hugo/full_graph.h
A hugo/vector_map_factory.h

Changes in the doc.

- DFS class (bfs.h and bfs_test.cc) added
- Bugfixes in Dijkstra and Bfs

correction

.

graph_wrapper.h is ready for hugo 0.2

minlengthpaths_test.cc is already hugo++ comform and is compilable

ResGraphWrapper<Graph> is done, so does dimacs.h.

Merge back the whole branches/hugo++ to trunk.

bug fix, test...

Demo directory...

sg is moved sg is not...

.

.

stGraphWrapper modifications

Revome an unnecessary (but still important) comment.

Add lp_solver_wrapper.h to work doxygen.

Add empty docs in order to make the functions and classes visible in
doxygen.

An experimental LPSolverWrapper class which uses glpk. For a short
demo, max flow problems are solved with it. This demo does not
demonstrates, but the main aims of this class are row and column
generation capabilities, i.e. to be a core for easily
implementable branch-and-cut a column generetion algorithms.

lp_solver_wrapper stuff.

technical corrections

flowValue() is reset to deal with excess[t].

Legal stuff, version 0.2.

New Doxygen module for path/flow algs.

New Doxygen module for path/flow algs.

resetXxx() changed to setXxx().

- A summary of the implemented graph structures.
- Some words on the different (and still nonexisting) graph concepts.

- 'KruskalPairVec' is changed to 'KruskalMapInput'.
- Changes in KruskalMapVec. Still does not work.

Test icc compiler as well.

doc change - one more todo (saveState()).

doc change - one more todo.

- Trimmed in order to work with gcc-3.4
- The number of executions of the tests can be controlled by command arg.

Bugfix in GRAPH_TYPEDEF_FACTORY

bug fixing

(none)

a bug test for preflow with preflow_bug_8 dimacs file

(none)

jacint javitgatott.

Some comments.

Bugfix + working example

- bfs-bench added
- hypercube generators moved to bench-tools.h
- new benchmark script

A very flexible bfs function using named parameters and impicit map types.

It is really obsolete, but containes interesting stuffs.

GraphWrapper::id(const Node&), GraphWrapper::id(const Edge&) function,
'cause I need it.

correction of some bugs pointed by alpar

Several changes in Kruskal alg.
- Input object interface was changed to an STL compatible one.
- template parameters of class KruskalPairVec has been simplified.
- (the most of) the names meet the naming conventions.
- a lot of (but still not enough) documentation has been added.
- class KruskalMapVec has been commented out.

Marci (and the other developpers),
please write exhaustive test code to avoid this kind of bugs...

gcc-3.4 tries to compile the _unused_ members of
an instantiated template class

A remark added.

Check StaticGraphSkeleton, as well.

Skeletons have been simplified.
"Optional features" have been deleted.
Map skeletons have been renamed.

max_flow.h added to Makefile.am

Custom made INSTALL file (will be sometime).

Repeat tests more times.

More documented file.

- Better Makefile.am. (I hope.)
- Some more tests

max_flow.h (wich doesn't use STL
- max_flow.h (which doesn't use STL stack) moved to /src/hugo
- for_each_macros.h was removed from max_flow.h
- (blocking) flow augmenting stuffs was removed.

We do not yet need it.

Do not ignore INSTALL.

Doesn't compile 5 times for the five execution.

For the sake of icc.

Indenting.

MapBase added

Indenting

Ready to run the first test series.

Test EdgeSet/NodeSet as well.

Turn on '-Wall' by default.

trying if without stl stack we are faster

without stl stack we are faster

Oops: "static" and "const" does not like each other.

src/becnhmark gets in the distro.
I hope it works well.

Some tools of common usage was put to bench_tool.h

Put some "static"'s.

docfix

A new benchmark (hcube)
and other minor changes

Warning fixation.

Temporal change: public Edge constructor with given ID.

Unnecessary friend declaration removed.

Added new make target 'benchmark'.

(none)

(none)

(none)

*** empty log message ***

Benchmarks

(none)

Capitalized section title.

Example in the doc is corrected.

- Bugfix in erase()
- reserveEdge() added

I moved run() into the body of class Dijkstra, because Doxygen handles
external member function definitions very poorly.

Fix some typos in docs.

Extended tutorial.

t/bin/bash: line 1: q: command not found
-j-This line, and those below, will be ignored--

M peter/hierarchygraph.h

(none)

I think I deserved it...

- Now, it is possible to have Dijkstra store its result directly in given maps.
- More docs.

Legal files. Proposal.

src/work/alpar/path.h (docs) is merged into src/work/klao/path.h
(and removed)

Doc updates

Branch from path.h to extend its documentation.

doc

doc

Nothing

Improved (but still not satisfactory) doc.

Small improvement on doc

New group for kruskal
Better links on the main page.

NetGraphs v0

c++ setting for emacs
Empty commands for doxygen

My notes.
Sources of information and software packages which could be interesting wrt
HUGO.

(none)

Restored common makefile.

Seems to work. More tests required.

Compiles now

Spell checking / indenting only.

New nice icons.

These will be customized icons for the doxygen tree view.

*** empty log message ***

Added a short tutorial on using graphs.

Added 'src/test/.deps' to the svn:ignore property.

Set svn:ignore on some files.

Added mrproper target.

Almost compiles.

Corrected some obvious errors.

ResCap, a map for the residual capacity in ResGraphWrapper

Almost ready.

ResGraphWrapper pretected default constructor

Not ready yet.

max_flow.h bug correction

bug correction in BidirGraphWrapper<Graph> default constructor

The new for macros are: h_for, h_for_inc, h_for_glob, h_for_inc_glob.

misc

misc

misc

a

Cooorected some eroorrs.

for_each fix

the same

max_flow.h: status flags for actMinCut
leda_graph_wrapper.h: NodeMapWrapper, EdgeMapWrapper

I don't really feel like working on this at the moment.

#ifndef correction

comparision of ListGraph, SmartGraph and SageGraph

To avoid confusion my old ListGraph is can be used under name SageGraph, work/sage_graph.h contains it.

some documentation in stGraphWrapper<Gr> and BipartiteGraphWrapper<Gr>

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

typo

for igcc-3.4.0

gcc-3.4.0

misc

To be on the safe side...

misc

as you see...

stGraphWrapper is almost working

Some more docs.

The doc modules clearly needs some restructuring...

Docs are now divided into modules.

#define HUGO_SMART_GRAPH_H ---> #define HUGO_LIST_GRAPH_H

More docs.

Try to compile before commit, please.

A missing conversion added

Some bugfixes.
Some more docs.

class NodeSet: A graph class with no edges
class EdgeSet: A graph class using the node set of another graph.
It compiles but untested and undocumented.