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
athos [Tue, 04 May 2004 09:00:11 +0000] rev 518
Started minlengthpaths_test, but it should not be here
athos [Tue, 04 May 2004 08:34:01 +0000] rev 517
Test file xy_test.cc finished. Really.
athos [Tue, 04 May 2004 08:31:48 +0000] rev 516
Test file xy_test.cc finished.
alpar [Mon, 03 May 2004 17:06:38 +0000] rev 515
To be compatible with gcc-3.4.0 ...
athos [Mon, 03 May 2004 14:43:49 +0000] rev 514
An awful mistake found and corrected.
athos [Mon, 03 May 2004 14:42:40 +0000] rev 513
xy_test added: it was not entirely useless, I found a mistake in xy.h
marci [Mon, 03 May 2004 11:43:27 +0000] rev 512
bip matching...
athos [Mon, 03 May 2004 10:27:20 +0000] rev 511
getPath() function implemented.
marci [Mon, 03 May 2004 10:04:27 +0000] rev 510
matching, flows
alpar [Mon, 03 May 2004 09:44:00 +0000] rev 509
(none)
alpar [Mon, 03 May 2004 09:43:03 +0000] rev 508
docfix.
alpar [Mon, 03 May 2004 09:38:17 +0000] rev 507
A "related pages" about Hugo Coding Style.
To be improved.
alpar [Mon, 03 May 2004 09:18:01 +0000] rev 506
Now it sucks the whole src/include and src/include/skeletons
instead of individual files.
athos [Mon, 03 May 2004 09:00:09 +0000] rev 505
I changed it to correspond changing requirements
alpar [Mon, 03 May 2004 08:13:41 +0000] rev 504
One more test case with minor importance.
alpar [Mon, 03 May 2004 07:27:29 +0000] rev 503
test/graph_test.cc added.
It discovered several bugs and warnings in 'include/smart_graph.h',
in 'include/skeletons/graph.h' and in 'work/alpar/list_graph.h'.
They have also been fixed.
marci [Fri, 30 Apr 2004 19:02:40 +0000] rev 502
static const bool BipartiteGraphWrapper<Graph>::S_CLASS, T_CLASS
marci [Fri, 30 Apr 2004 18:43:18 +0000] rev 501
bipatite
marci [Fri, 30 Apr 2004 17:48:50 +0000] rev 500
misc
marci [Fri, 30 Apr 2004 17:10:01 +0000] rev 499
A bipartite graph template can be used as BipartiteGraph<ListGraph>.
marci [Fri, 30 Apr 2004 16:46:19 +0000] rev 498
bipartite graphs
marci [Fri, 30 Apr 2004 16:10:49 +0000] rev 497
bipartite graph in bipartite_graph_wrapper.h
marci [Fri, 30 Apr 2004 14:02:10 +0000] rev 496
gw
marci [Fri, 30 Apr 2004 13:52:17 +0000] rev 495
(none)
jacint [Fri, 30 Apr 2004 06:46:39 +0000] rev 494
Felkesz kod!
klao [Fri, 30 Apr 2004 01:59:15 +0000] rev 493
DirPath fejlodes.
Kiserleti struktura a forditasi idoben kapcsolhato konzisztencia es range
ellenorzesekre.
klao [Fri, 30 Apr 2004 01:10:13 +0000] rev 492
spell checking
klao [Fri, 30 Apr 2004 01:02:22 +0000] rev 491
ingroup bug
klao [Thu, 29 Apr 2004 23:24:42 +0000] rev 490
The -W gcc option _does_ matter even if you use -Wall!
Minor changes.
klao [Thu, 29 Apr 2004 22:39:17 +0000] rev 489
Basic error handling facilities
(and possibly a g++-3.4.0 bug)
marci [Thu, 29 Apr 2004 19:38:53 +0000] rev 488
misc
marci [Thu, 29 Apr 2004 19:25:52 +0000] rev 487
some documentation
marci [Thu, 29 Apr 2004 18:48:25 +0000] rev 486
TODO
marci [Thu, 29 Apr 2004 17:34:42 +0000] rev 485
Some docu in MaxFlow class, jacint/max_flow.h
beckerjc [Thu, 29 Apr 2004 17:23:56 +0000] rev 484
Move unionfind.h in Doxyfile too
beckerjc [Thu, 29 Apr 2004 17:00:44 +0000] rev 483
UnionFind moved to include. Test compiles and runs cleanly.
* test/makefile:
minor cleanups
marci [Thu, 29 Apr 2004 16:59:00 +0000] rev 482
corrections for leda matching files
beckerjc [Thu, 29 Apr 2004 16:45:40 +0000] rev 481
Three new methods in UnionFindEnum.
UnionFindEnum completed.
marci [Thu, 29 Apr 2004 16:30:39 +0000] rev 480
corrections
alpar [Thu, 29 Apr 2004 16:29:43 +0000] rev 479
Main page added.
marci [Thu, 29 Apr 2004 16:26:01 +0000] rev 478
preflow.f -> max_flow.h
alpar [Thu, 29 Apr 2004 16:26:01 +0000] rev 477
doc
marci [Thu, 29 Apr 2004 16:25:03 +0000] rev 476
preflow, maxflow
marci [Thu, 29 Apr 2004 16:08:16 +0000] rev 475
edmonds_karp_demo->max_flow_demo
marci [Thu, 29 Apr 2004 16:07:10 +0000] rev 474
edmonds_karp
marci [Thu, 29 Apr 2004 16:04:27 +0000] rev 473
ledagraph
marci [Thu, 29 Apr 2004 15:58:34 +0000] rev 472
preflow, maxflow
marci [Thu, 29 Apr 2004 15:01:52 +0000] rev 471
misc
jacint [Thu, 29 Apr 2004 11:09:12 +0000] rev 470
Comparison == changed to <=
marci [Thu, 29 Apr 2004 10:51:58 +0000] rev 469
const-ok
marci [Thu, 29 Apr 2004 10:41:56 +0000] rev 468
nem irunk olyat hogy "void resetTarget(const Node _t) {t=_t;}" mert az a const az ott jobbara hulyeseg
marci [Thu, 29 Apr 2004 10:29:51 +0000] rev 467
preflow maxflow ...
marci [Thu, 29 Apr 2004 10:16:46 +0000] rev 466
preflow, maxflow comp
marci [Thu, 29 Apr 2004 09:08:14 +0000] rev 465
mods implied by preflow mods
alpar [Thu, 29 Apr 2004 08:42:05 +0000] rev 464
It breaks my heart to say them goodbye...
alpar [Thu, 29 Apr 2004 08:33:16 +0000] rev 463
doc