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

Wed, 14 Nov 2007 15:36:37 +0000removing semicolon ftom the end of GRAPH_TYPEDEFS
deba [Wed, 14 Nov 2007 15:36:37 +0000] rev 2510
removing semicolon ftom the end of GRAPH_TYPEDEFS

Wed, 14 Nov 2007 06:28:08 +0000Small changes in the min. cost flow classes.
kpeter [Wed, 14 Nov 2007 06:28:08 +0000] rev 2509
Small changes in the min. cost flow classes.

Thu, 08 Nov 2007 14:21:28 +0000Planar graph coloring
deba [Thu, 08 Nov 2007 14:21:28 +0000] rev 2508
Planar graph coloring

Wed, 07 Nov 2007 21:52:57 +0000Small bug fix.
kpeter [Wed, 07 Nov 2007 21:52:57 +0000] rev 2507
Small bug fix.

Tue, 30 Oct 2007 20:44:53 +0000Change to new union-find interface
deba [Tue, 30 Oct 2007 20:44:53 +0000] rev 2506
Change to new union-find interface

Tue, 30 Oct 2007 20:21:10 +0000Redesign interface of MaxMatching and UnionFindEnum
deba [Tue, 30 Oct 2007 20:21:10 +0000] rev 2505
Redesign interface of MaxMatching and UnionFindEnum
New class ExtendFindEnum

Faster MaxMatching

Tue, 30 Oct 2007 10:51:07 +0000Bug fix
deba [Tue, 30 Oct 2007 10:51:07 +0000] rev 2504
Bug fix

Thu, 25 Oct 2007 16:57:43 +0000Fix a typo that caused the failure of 'make dist'
alpar [Thu, 25 Oct 2007 16:57:43 +0000] rev 2503
Fix a typo that caused the failure of 'make dist'

Wed, 24 Oct 2007 16:31:49 +0000BpUGraphReader and Writer
deba [Wed, 24 Oct 2007 16:31:49 +0000] rev 2502
BpUGraphReader and Writer

Sat, 20 Oct 2007 14:29:12 +0000Forgotten images
deba [Sat, 20 Oct 2007 14:29:12 +0000] rev 2501
Forgotten images

Fri, 19 Oct 2007 17:07:50 +0000planar doxygen group
deba [Fri, 19 Oct 2007 17:07:50 +0000] rev 2500
planar doxygen group

Fri, 19 Oct 2007 16:24:31 +0000Planar Grid Embedding
deba [Fri, 19 Oct 2007 16:24:31 +0000] rev 2499
Planar Grid Embedding

Fri, 19 Oct 2007 15:21:07 +0000Bug fix in undirected graphs (adding loops)
deba [Fri, 19 Oct 2007 15:21:07 +0000] rev 2498
Bug fix in undirected graphs (adding loops)
Bug fix in undirected edgesets (alteration notifying)

Redesigned undirected edgesets (like the smart or ugraph)

Fri, 19 Oct 2007 13:50:13 +0000Build fix.
ladanyi [Fri, 19 Oct 2007 13:50:13 +0000] rev 2497
Build fix.

Wed, 17 Oct 2007 12:46:14 +0000setAll for iterable bool maps
deba [Wed, 17 Oct 2007 12:46:14 +0000] rev 2496
setAll for iterable bool maps

Sat, 13 Oct 2007 08:48:07 +0000Added the function isFinite(), and replaced the calls to finite() with it.
ladanyi [Sat, 13 Oct 2007 08:48:07 +0000] rev 2495
Added the function isFinite(), and replaced the calls to finite() with it.
This was necessary because finite() is not a standard function. Neither can
we use its standard counterpart isfinite(), because it was introduced only
in C99, and therefore it is not supplied by all C++ implementations.

Fri, 12 Oct 2007 22:19:03 +0000Makefile fix.
ladanyi [Fri, 12 Oct 2007 22:19:03 +0000] rev 2494
Makefile fix.

Tue, 09 Oct 2007 17:46:06 +0000Bad documentation
deba [Tue, 09 Oct 2007 17:46:06 +0000] rev 2493
Bad documentation

Tue, 09 Oct 2007 17:13:17 +0000Adding doc
deba [Tue, 09 Oct 2007 17:13:17 +0000] rev 2492
Adding doc

Tue, 09 Oct 2007 17:11:42 +0000Documentation for lemon tools
deba [Tue, 09 Oct 2007 17:11:42 +0000] rev 2491
Documentation for lemon tools

Tue, 09 Oct 2007 16:22:04 +0000Minor bug fixes in documentation
deba [Tue, 09 Oct 2007 16:22:04 +0000] rev 2490
Minor bug fixes in documentation

Tue, 09 Oct 2007 15:46:12 +0000Bug fix and redesign StdMap
deba [Tue, 09 Oct 2007 15:46:12 +0000] rev 2489
Bug fix and redesign StdMap
Improving map adaptors documentations

Tue, 09 Oct 2007 09:36:54 +0000Bug fix in MaxMatching
deba [Tue, 09 Oct 2007 09:36:54 +0000] rev 2488
Bug fix in MaxMatching

Tue, 02 Oct 2007 14:20:04 +0000Removing other occurences of cnt
deba [Tue, 02 Oct 2007 14:20:04 +0000] rev 2487
Removing other occurences of cnt