athos [Thu, 06 May 2004 15:19:59 +0000] rev 551
Written hugo/ into includes.
alpar [Thu, 06 May 2004 15:14:13 +0000] rev 550
Some tests must have been commented out temporarily.
marci [Thu, 06 May 2004 15:10:48 +0000] rev 549
(none)
marci [Thu, 06 May 2004 14:25:21 +0000] rev 548
(none)
athos [Thu, 06 May 2004 14:23:48 +0000] rev 547
Modified a little bit
alpar [Thu, 06 May 2004 14:21:57 +0000] rev 546
No automatic doc generation.
alpar [Thu, 06 May 2004 14:11:09 +0000] rev 545
Test cases for time_measure.h
marci [Thu, 06 May 2004 14:00:50 +0000] rev 544
(none)
marci [Thu, 06 May 2004 13:48:48 +0000] rev 543
an experimental topsort
ladanyi [Thu, 06 May 2004 13:48:04 +0000] rev 542
Set up automake environment.
marci [Thu, 06 May 2004 13:46:07 +0000] rev 541
(none)
marci [Thu, 06 May 2004 13:44:48 +0000] rev 540
(none)
ladanyi [Thu, 06 May 2004 13:21:24 +0000] rev 539
Rename 'include' to 'hugo' (for automake)
jacint [Thu, 06 May 2004 09:26:23 +0000] rev 538
(none)
jacint [Wed, 05 May 2004 17:51:56 +0000] rev 537
Contains Edmonds' matching algorithm in a plain and in a heuristical form.
jacint [Wed, 05 May 2004 17:29:41 +0000] rev 536
tests max_matching.h
jacint [Wed, 05 May 2004 17:24:06 +0000] rev 535
(none)
jacint [Wed, 05 May 2004 17:23:04 +0000] rev 534
primitive random graph generator
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.