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?

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.