Wed, 05 May 2004 17:51:56 +0000Contains Edmonds' matching algorithm in a plain and in a heuristical form.
jacint [Wed, 05 May 2004 17:51:56 +0000] rev 537
Contains Edmonds' matching algorithm in a plain and in a heuristical form.

Wed, 05 May 2004 17:29:41 +0000tests max_matching.h
jacint [Wed, 05 May 2004 17:29:41 +0000] rev 536
tests max_matching.h

Wed, 05 May 2004 17:24:06 +0000(none)
jacint [Wed, 05 May 2004 17:24:06 +0000] rev 535
(none)

Wed, 05 May 2004 17:23:04 +0000primitive random graph generator
jacint [Wed, 05 May 2004 17:23:04 +0000] rev 534
primitive random graph generator

Wed, 05 May 2004 08:36:00 +0000Minor bugfix.
alpar [Wed, 05 May 2004 08:36:00 +0000] rev 533
Minor bugfix.

Wed, 05 May 2004 08:18:19 +0000Compiles also with icc.
alpar [Wed, 05 May 2004 08:18:19 +0000] rev 532
Compiles also with icc.

Wed, 05 May 2004 07:53:51 +0000Compiles with are icc, as well.
alpar [Wed, 05 May 2004 07:53:51 +0000] rev 531
Compiles with are icc, as well.

Tue, 04 May 2004 16:52:15 +0000Minimum cost flows of small values: algorithm from Andras Frank's lecture notes (approximately)
athos [Tue, 04 May 2004 16:52:15 +0000] rev 530
Minimum cost flows of small values: algorithm from Andras Frank's lecture notes (approximately)

Tue, 04 May 2004 16:17:17 +0000Adding update() to NullMap
jacint [Tue, 04 May 2004 16:17:17 +0000] rev 529
Adding update() to NullMap

Tue, 04 May 2004 16:16:49 +0000Able to read min cost flow, max flow, shortest path, matching testgraphs
jacint [Tue, 04 May 2004 16:16:49 +0000] rev 528
Able to read min cost flow, max flow, shortest path, matching testgraphs

Tue, 04 May 2004 14:54:21 +0000Nem tudom, a hugo-n miert nem megy.
athos [Tue, 04 May 2004 14:54:21 +0000] rev 527
Nem tudom, a hugo-n miert nem megy.

Tue, 04 May 2004 14:06:00 +0000bool forward(Edge), bool backward(Edge)
marci [Tue, 04 May 2004 14:06:00 +0000] rev 526
bool forward(Edge), bool backward(Edge)

Tue, 04 May 2004 12:03:04 +0000misc
marci [Tue, 04 May 2004 12:03:04 +0000] rev 525
misc

Tue, 04 May 2004 12:01:49 +0000An undirected graph template UndirGraph<Graph> can be used.
marci [Tue, 04 May 2004 12:01:49 +0000] rev 524
An undirected graph template UndirGraph<Graph> can be used.