deba [Wed, 21 Nov 2007 13:35:10 +0000] rev 2519
Changed queue implementation
deba [Wed, 21 Nov 2007 13:34:38 +0000] rev 2518
Bugfix in min cut computation
kpeter [Tue, 20 Nov 2007 21:40:55 +0000] rev 2517
Small changes in the documentation.
deba [Tue, 20 Nov 2007 15:06:03 +0000] rev 2516
Nauty graph6 reader
deba [Sat, 17 Nov 2007 21:41:01 +0000] rev 2515
Changing max flow interface
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)
deba [Wed, 14 Nov 2007 17:53:08 +0000] rev 2513
Query the result value of an expression
deba [Wed, 14 Nov 2007 17:44:42 +0000] rev 2512
Elevator: slight changes in elevator interface
LinkedElevator: based on linked lists
deba [Wed, 14 Nov 2007 17:42:48 +0000] rev 2511
IntegerMap
deba [Wed, 14 Nov 2007 15:36:37 +0000] rev 2510
removing semicolon ftom the end of GRAPH_TYPEDEFS
kpeter [Wed, 14 Nov 2007 06:28:08 +0000] rev 2509
Small changes in the min. cost flow classes.
deba [Thu, 08 Nov 2007 14:21:28 +0000] rev 2508
Planar graph coloring
kpeter [Wed, 07 Nov 2007 21:52:57 +0000] rev 2507
Small bug fix.
deba [Tue, 30 Oct 2007 20:44:53 +0000] rev 2506
Change to new union-find interface
deba [Tue, 30 Oct 2007 20:21:10 +0000] rev 2505
Redesign interface of MaxMatching and UnionFindEnum
New class ExtendFindEnum
Faster MaxMatching
deba [Tue, 30 Oct 2007 10:51:07 +0000] rev 2504
Bug fix
alpar [Thu, 25 Oct 2007 16:57:43 +0000] rev 2503
Fix a typo that caused the failure of 'make dist'
deba [Wed, 24 Oct 2007 16:31:49 +0000] rev 2502
BpUGraphReader and Writer
deba [Sat, 20 Oct 2007 14:29:12 +0000] rev 2501
Forgotten images
deba [Fri, 19 Oct 2007 17:07:50 +0000] rev 2500
planar doxygen group
deba [Fri, 19 Oct 2007 16:24:31 +0000] rev 2499
Planar Grid Embedding
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)
ladanyi [Fri, 19 Oct 2007 13:50:13 +0000] rev 2497
Build fix.
deba [Wed, 17 Oct 2007 12:46:14 +0000] rev 2496
setAll for iterable bool maps
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.
ladanyi [Fri, 12 Oct 2007 22:19:03 +0000] rev 2494
Makefile fix.
deba [Tue, 09 Oct 2007 17:46:06 +0000] rev 2493
Bad documentation
deba [Tue, 09 Oct 2007 17:13:17 +0000] rev 2492
Adding doc