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
Tue, 04 May 2004 14:54:21 +0000 athos Nem tudom, a hugo-n miert nem megy.
Tue, 04 May 2004 14:06:00 +0000 marci bool forward(Edge), bool backward(Edge)
Tue, 04 May 2004 12:03:04 +0000 marci misc
Tue, 04 May 2004 12:01:49 +0000 marci An undirected graph template UndirGraph<Graph> can be used.
Tue, 04 May 2004 12:00:13 +0000 athos Started.
Tue, 04 May 2004 11:20:16 +0000 athos Nothing special.
Tue, 04 May 2004 10:58:42 +0000 athos Ezt mintha mar toroltem volna.
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
Tue, 04 May 2004 09:03:00 +0000 athos Putting things in their place
Tue, 04 May 2004 09:00:11 +0000 athos Started minlengthpaths_test, but it should not be here