alpar [Fri, 07 May 2004 10:22:30 +0000] rev 574
*** empty log message ***
marci [Fri, 07 May 2004 09:05:23 +0000] rev 573
(none)
marci [Fri, 07 May 2004 08:48:11 +0000] rev 572
Edge opposite(const Edge&) in BidirGaphWrapper<Graph>
deba [Fri, 07 May 2004 08:18:30 +0000] rev 571
(none)
alpar [Fri, 07 May 2004 08:02:17 +0000] rev 570
Compile checks added.
marci [Fri, 07 May 2004 07:44:44 +0000] rev 569
BidirGraphWrapper<Graph>, the map values are different for the opposite edges.
alpar [Fri, 07 May 2004 06:58:24 +0000] rev 568
An alternative dijkstra_test.cc
alpar [Fri, 07 May 2004 06:57:50 +0000] rev 567
time_measure.cc was renamed to time_measure_test.cc
Add an alternative dijsktra_test.cc
alpar [Fri, 07 May 2004 06:35:02 +0000] rev 566
Exit with correct return value
marci [Fri, 07 May 2004 06:33:02 +0000] rev 565
ResGraphWrapper mods.
alpar [Fri, 07 May 2004 05:29:45 +0000] rev 564
skeleton tests turned on again.
ladanyi [Thu, 06 May 2004 23:05:01 +0000] rev 563
We need to distribute the headers in 'skeletons' too.
ladanyi [Thu, 06 May 2004 22:24:02 +0000] rev 562
No automatic doc generation.
marci [Thu, 06 May 2004 19:01:00 +0000] rev 561
(none)
marci [Thu, 06 May 2004 18:07:45 +0000] rev 560
(none)
marci [Thu, 06 May 2004 17:45:12 +0000] rev 559
A max bipartite matching class in src/work/marci/max_bipartite_matching.h
which can be used for computing maximum cardinality ordinary matching, b-matching and capacitated b-matching.
marci [Thu, 06 May 2004 17:22:11 +0000] rev 558
random graph, random bipartite graph in jacint/graph_gen.h
marci [Thu, 06 May 2004 17:01:31 +0000] rev 557
(none)
marci [Thu, 06 May 2004 16:55:59 +0000] rev 556
graph_wrapper.h in hugo
marci [Thu, 06 May 2004 16:54:54 +0000] rev 555
#include <hugo/ > modifications
athos [Thu, 06 May 2004 15:47:42 +0000] rev 554
Method checkSolution() added.
marci [Thu, 06 May 2004 15:39:31 +0000] rev 553
SubGraphWrapper bug ok
marci [Thu, 06 May 2004 15:24:42 +0000] rev 552
top-sort, for fezso's sake
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.
athos [Tue, 04 May 2004 12:00:13 +0000] rev 523
Started.
athos [Tue, 04 May 2004 11:20:16 +0000] rev 522
Nothing special.
athos [Tue, 04 May 2004 10:58:42 +0000] rev 521
Ezt mintha mar toroltem volna.
athos [Tue, 04 May 2004 09:33:21 +0000] rev 520
Created minlengthpaths_test.cc. Compiles with: g++-3.0 -Wall -I. -I../{klao,jacint,marci} -I.. -I../../include minlengthpaths_test.cc -o min | & less
athos [Tue, 04 May 2004 09:03:00 +0000] rev 519
Putting things in their place