Wed, 05 Dec 2007 12:57:24 +0000Improved docs.
kpeter [Wed, 05 Dec 2007 12:57:24 +0000] rev 2534
Improved docs.

Wed, 05 Dec 2007 01:43:02 +0000Bug fixes.
kpeter [Wed, 05 Dec 2007 01:43:02 +0000] rev 2533
Bug fixes.

Tue, 04 Dec 2007 18:51:35 +0000Bug fixes in the rename script.
kpeter [Tue, 04 Dec 2007 18:51:35 +0000] rev 2532
Bug fixes in the rename script.

Tue, 04 Dec 2007 14:08:27 +0000rename graphs script
deba [Tue, 04 Dec 2007 14:08:27 +0000] rev 2531
rename graphs script

Tue, 04 Dec 2007 10:55:27 +0000Reimplementation of Hao-Orlin algorithm
deba [Tue, 04 Dec 2007 10:55:27 +0000] rev 2530
Reimplementation of Hao-Orlin algorithm
Little modifictaion in NagamochiIbaraki
More docs for minimum cut algorithms

Fri, 30 Nov 2007 09:22:38 +0000Minor changes
deba [Fri, 30 Nov 2007 09:22:38 +0000] rev 2529
Minor changes

Wed, 28 Nov 2007 18:05:49 +0000Gomory-Hu tree algorithm
deba [Wed, 28 Nov 2007 18:05:49 +0000] rev 2528
Gomory-Hu tree algorithm

Wed, 28 Nov 2007 18:01:38 +0000bug fix
deba [Wed, 28 Nov 2007 18:01:38 +0000] rev 2527
bug fix
class without constructor error

Wed, 28 Nov 2007 17:51:02 +0000Redesign Circulation interface according to new flow interface
deba [Wed, 28 Nov 2007 17:51:02 +0000] rev 2526
Redesign Circulation interface according to new flow interface
New greedy approach initialization

Wed, 28 Nov 2007 17:40:41 +0000Using linked elevator
deba [Wed, 28 Nov 2007 17:40:41 +0000] rev 2525
Using linked elevator
It is conform to the Graph concept in that sense
the graph maps should not be ReferenceMap

Wed, 28 Nov 2007 16:42:58 +0000Bug fix resetting activeness of node at initialization
deba [Wed, 28 Nov 2007 16:42:58 +0000] rev 2524
Bug fix resetting activeness of node at initialization

Tue, 27 Nov 2007 16:26:58 +0000Fix warning when compiling with -Wall.
ladanyi [Tue, 27 Nov 2007 16:26:58 +0000] rev 2523
Fix warning when compiling with -Wall.

Tue, 27 Nov 2007 15:41:43 +0000Performance bug in Preflow
deba [Tue, 27 Nov 2007 15:41:43 +0000] rev 2522
Performance bug in Preflow
The initial relabeling moved each node to the lowest level
Doc bug fix

Sun, 25 Nov 2007 22:56:44 +0000Bugfix: using read-write map instead reference map
deba [Sun, 25 Nov 2007 22:56:44 +0000] rev 2521
Bugfix: using read-write map instead reference map

Wed, 21 Nov 2007 18:19:20 +0000Better solution
deba [Wed, 21 Nov 2007 18:19:20 +0000] rev 2520
Better solution

Wed, 21 Nov 2007 13:35:10 +0000Changed queue implementation
deba [Wed, 21 Nov 2007 13:35:10 +0000] rev 2519
Changed queue implementation

Wed, 21 Nov 2007 13:34:38 +0000Bugfix in min cut computation
deba [Wed, 21 Nov 2007 13:34:38 +0000] rev 2518
Bugfix in min cut computation

Tue, 20 Nov 2007 21:40:55 +0000Small changes in the documentation.
kpeter [Tue, 20 Nov 2007 21:40:55 +0000] rev 2517
Small changes in the documentation.

Tue, 20 Nov 2007 15:06:03 +0000Nauty graph6 reader
deba [Tue, 20 Nov 2007 15:06:03 +0000] rev 2516
Nauty graph6 reader

Sat, 17 Nov 2007 21:41:01 +0000Changing max flow interface
deba [Sat, 17 Nov 2007 21:41:01 +0000] rev 2515
Changing max flow interface

Sat, 17 Nov 2007 20:58:11 +0000Redesign the maximum flow algorithms
deba [Sat, 17 Nov 2007 20:58:11 +0000] rev 2514
Redesign the maximum flow algorithms

Redesigned interface
Preflow changed to use elevator
Edmonds-Karp does not use the ResGraphAdaptor
Goldberg-Tarjan algorithm (Preflow with Dynamic Trees)
Dinitz-Sleator-Tarjan (Blocking flow with Dynamic Tree)

Wed, 14 Nov 2007 17:53:08 +0000Query the result value of an expression
deba [Wed, 14 Nov 2007 17:53:08 +0000] rev 2513
Query the result value of an expression

Wed, 14 Nov 2007 17:44:42 +0000Elevator: slight changes in elevator interface
deba [Wed, 14 Nov 2007 17:44:42 +0000] rev 2512
Elevator: slight changes in elevator interface
LinkedElevator: based on linked lists

Wed, 14 Nov 2007 17:42:48 +0000IntegerMap
deba [Wed, 14 Nov 2007 17:42:48 +0000] rev 2511
IntegerMap