alpar [Wed, 05 May 2004 08:36:00 +0000] rev 533
Minor bugfix.
alpar [Wed, 05 May 2004 08:18:19 +0000] rev 532
Compiles also with icc.
alpar [Wed, 05 May 2004 07:53:51 +0000] rev 531
Compiles with are icc, as well.
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)
jacint [Tue, 04 May 2004 16:17:17 +0000] rev 529
Adding update() to NullMap
jacint [Tue, 04 May 2004 16:16:49 +0000] rev 528
Able to read min cost flow, max flow, shortest path, matching testgraphs
athos [Tue, 04 May 2004 14:54:21 +0000] rev 527
Nem tudom, a hugo-n miert nem megy.
marci [Tue, 04 May 2004 14:06:00 +0000] rev 526
bool forward(Edge), bool backward(Edge)
marci [Tue, 04 May 2004 12:03:04 +0000] rev 525
misc
marci [Tue, 04 May 2004 12:01:49 +0000] rev 524
An undirected graph template UndirGraph<Graph> can be used.