Thu, 06 May 2004 16:54:54 +0000 marci #include <hugo/ > modifications
Thu, 06 May 2004 15:47:42 +0000 athos Method checkSolution() added.
Thu, 06 May 2004 15:39:31 +0000 marci SubGraphWrapper bug ok
Thu, 06 May 2004 15:24:42 +0000 marci top-sort, for fezso's sake
Thu, 06 May 2004 15:19:59 +0000 athos Written hugo/ into includes.
Thu, 06 May 2004 15:14:13 +0000 alpar Some tests must have been commented out temporarily.
Thu, 06 May 2004 15:10:48 +0000 marci (none)
Thu, 06 May 2004 14:25:21 +0000 marci (none)
Thu, 06 May 2004 14:23:48 +0000 athos Modified a little bit
Thu, 06 May 2004 14:21:57 +0000 alpar No automatic doc generation.
Thu, 06 May 2004 14:11:09 +0000 alpar Test cases for time_measure.h
Thu, 06 May 2004 14:00:50 +0000 marci (none)
Thu, 06 May 2004 13:48:48 +0000 marci an experimental topsort
Thu, 06 May 2004 13:48:04 +0000 ladanyi Set up automake environment.
Thu, 06 May 2004 13:46:07 +0000 marci (none)
Thu, 06 May 2004 13:44:48 +0000 marci (none)
Thu, 06 May 2004 13:21:24 +0000 ladanyi Rename 'include' to 'hugo' (for automake)
Thu, 06 May 2004 09:26:23 +0000 jacint (none)
Wed, 05 May 2004 17:51:56 +0000 jacint Contains Edmonds' matching algorithm in a plain and in a heuristical form.
Wed, 05 May 2004 17:29:41 +0000 jacint tests max_matching.h
Wed, 05 May 2004 17:24:06 +0000 jacint (none)
Wed, 05 May 2004 17:23:04 +0000 jacint primitive random graph generator
Wed, 05 May 2004 08:36:00 +0000 alpar Minor bugfix.
Wed, 05 May 2004 08:18:19 +0000 alpar Compiles also with icc.
Wed, 05 May 2004 07:53:51 +0000 alpar Compiles with are icc, as well.
Tue, 04 May 2004 16:52:15 +0000 athos Minimum cost flows of small values: algorithm from Andras Frank's lecture notes (approximately)
Tue, 04 May 2004 16:17:17 +0000 jacint Adding update() to NullMap
Tue, 04 May 2004 16:16:49 +0000 jacint Able to read min cost flow, max flow, shortest path, matching testgraphs