| Thu, 06 May 2004 15:24:42 +0000 |
marci |
top-sort, for fezso's sake
|
changeset |
files
|
| Thu, 06 May 2004 15:19:59 +0000 |
athos |
Written hugo/ into includes.
|
changeset |
files
|
| Thu, 06 May 2004 15:14:13 +0000 |
alpar |
Some tests must have been commented out temporarily.
|
changeset |
files
|
| Thu, 06 May 2004 15:10:48 +0000 |
marci |
(none)
|
changeset |
files
|
| Thu, 06 May 2004 14:25:21 +0000 |
marci |
(none)
|
changeset |
files
|
| Thu, 06 May 2004 14:23:48 +0000 |
athos |
Modified a little bit
|
changeset |
files
|
| Thu, 06 May 2004 14:21:57 +0000 |
alpar |
No automatic doc generation.
|
changeset |
files
|
| Thu, 06 May 2004 14:11:09 +0000 |
alpar |
Test cases for time_measure.h
|
changeset |
files
|
| Thu, 06 May 2004 14:00:50 +0000 |
marci |
(none)
|
changeset |
files
|
| Thu, 06 May 2004 13:48:48 +0000 |
marci |
an experimental topsort
|
changeset |
files
|
| Thu, 06 May 2004 13:48:04 +0000 |
ladanyi |
Set up automake environment.
|
changeset |
files
|
| Thu, 06 May 2004 13:46:07 +0000 |
marci |
(none)
|
changeset |
files
|
| Thu, 06 May 2004 13:44:48 +0000 |
marci |
(none)
|
changeset |
files
|
| Thu, 06 May 2004 13:21:24 +0000 |
ladanyi |
Rename 'include' to 'hugo' (for automake)
|
changeset |
files
|
| Thu, 06 May 2004 09:26:23 +0000 |
jacint |
(none)
|
changeset |
files
|
| Wed, 05 May 2004 17:51:56 +0000 |
jacint |
Contains Edmonds' matching algorithm in a plain and in a heuristical form.
|
changeset |
files
|
| Wed, 05 May 2004 17:29:41 +0000 |
jacint |
tests max_matching.h
|
changeset |
files
|
| Wed, 05 May 2004 17:24:06 +0000 |
jacint |
(none)
|
changeset |
files
|
| Wed, 05 May 2004 17:23:04 +0000 |
jacint |
primitive random graph generator
|
changeset |
files
|
| Wed, 05 May 2004 08:36:00 +0000 |
alpar |
Minor bugfix.
|
changeset |
files
|
| Wed, 05 May 2004 08:18:19 +0000 |
alpar |
Compiles also with icc.
|
changeset |
files
|
| Wed, 05 May 2004 07:53:51 +0000 |
alpar |
Compiles with are icc, as well.
|
changeset |
files
|
| Tue, 04 May 2004 16:52:15 +0000 |
athos |
Minimum cost flows of small values: algorithm from Andras Frank's lecture notes (approximately)
|
changeset |
files
|
| Tue, 04 May 2004 16:17:17 +0000 |
jacint |
Adding update() to NullMap
|
changeset |
files
|
| Tue, 04 May 2004 16:16:49 +0000 |
jacint |
Able to read min cost flow, max flow, shortest path, matching testgraphs
|
changeset |
files
|
| Tue, 04 May 2004 14:54:21 +0000 |
athos |
Nem tudom, a hugo-n miert nem megy.
|
changeset |
files
|
| Tue, 04 May 2004 14:06:00 +0000 |
marci |
bool forward(Edge), bool backward(Edge)
|
changeset |
files
|
| Tue, 04 May 2004 12:03:04 +0000 |
marci |
misc
|
changeset |
files
|
| Tue, 04 May 2004 12:01:49 +0000 |
marci |
An undirected graph template UndirGraph<Graph> can be used.
|
changeset |
files
|
| Tue, 04 May 2004 12:00:13 +0000 |
athos |
Started.
|
changeset |
files
|
| Tue, 04 May 2004 11:20:16 +0000 |
athos |
Nothing special.
|
changeset |
files
|
| Tue, 04 May 2004 10:58:42 +0000 |
athos |
Ezt mintha mar toroltem volna.
|
changeset |
files
|
| Tue, 04 May 2004 09:33:21 +0000 |
athos |
Created minlengthpaths_test.cc. Compiles with: g++-3.0 -Wall -I. -I../{klao,jacint,marci} -I.. -I../../include minlengthpaths_test.cc -o min | & less
|
changeset |
files
|
| Tue, 04 May 2004 09:03:00 +0000 |
athos |
Putting things in their place
|
changeset |
files
|
| Tue, 04 May 2004 09:00:11 +0000 |
athos |
Started minlengthpaths_test, but it should not be here
|
changeset |
files
|
| Tue, 04 May 2004 08:34:01 +0000 |
athos |
Test file xy_test.cc finished. Really.
|
changeset |
files
|
| Tue, 04 May 2004 08:31:48 +0000 |
athos |
Test file xy_test.cc finished.
|
changeset |
files
|
| Mon, 03 May 2004 17:06:38 +0000 |
alpar |
To be compatible with gcc-3.4.0 ...
|
changeset |
files
|
| Mon, 03 May 2004 14:43:49 +0000 |
athos |
An awful mistake found and corrected.
|
changeset |
files
|
| Mon, 03 May 2004 14:42:40 +0000 |
athos |
xy_test added: it was not entirely useless, I found a mistake in xy.h
|
changeset |
files
|
| Mon, 03 May 2004 11:43:27 +0000 |
marci |
bip matching...
|
changeset |
files
|
| Mon, 03 May 2004 10:27:20 +0000 |
athos |
getPath() function implemented.
|
changeset |
files
|
| Mon, 03 May 2004 10:04:27 +0000 |
marci |
matching, flows
|
changeset |
files
|
| Mon, 03 May 2004 09:44:00 +0000 |
alpar |
(none)
|
changeset |
files
|
| Mon, 03 May 2004 09:43:03 +0000 |
alpar |
docfix.
|
changeset |
files
|
| Mon, 03 May 2004 09:38:17 +0000 |
alpar |
A "related pages" about Hugo Coding Style.
|
changeset |
files
|
| Mon, 03 May 2004 09:18:01 +0000 |
alpar |
Now it sucks the whole src/include and src/include/skeletons
|
changeset |
files
|
| Mon, 03 May 2004 09:00:09 +0000 |
athos |
I changed it to correspond changing requirements
|
changeset |
files
|
| Mon, 03 May 2004 08:13:41 +0000 |
alpar |
One more test case with minor importance.
|
changeset |
files
|
| Mon, 03 May 2004 07:27:29 +0000 |
alpar |
test/graph_test.cc added.
|
changeset |
files
|
| Fri, 30 Apr 2004 19:02:40 +0000 |
marci |
static const bool BipartiteGraphWrapper<Graph>::S_CLASS, T_CLASS
|
changeset |
files
|
| Fri, 30 Apr 2004 18:43:18 +0000 |
marci |
bipatite
|
changeset |
files
|
| Fri, 30 Apr 2004 17:48:50 +0000 |
marci |
misc
|
changeset |
files
|
| Fri, 30 Apr 2004 17:10:01 +0000 |
marci |
A bipartite graph template can be used as BipartiteGraph<ListGraph>.
|
changeset |
files
|
| Fri, 30 Apr 2004 16:46:19 +0000 |
marci |
bipartite graphs
|
changeset |
files
|
| Fri, 30 Apr 2004 16:10:49 +0000 |
marci |
bipartite graph in bipartite_graph_wrapper.h
|
changeset |
files
|