deba [Sat, 11 Aug 2007 16:34:41 +0000] rev 2462
Common interface for bipartite matchings
Some useful query function for push-relabel based matching
The naming should be rethink for these classes
for example: pr-ap prefix for push-relabel and augmenting path
algorithms
deba [Thu, 26 Jul 2007 13:59:12 +0000] rev 2461
Reporting invalid ID
deba [Thu, 26 Jul 2007 12:18:02 +0000] rev 2460
Correction in the line numbering method
deba [Thu, 05 Jul 2007 16:39:42 +0000] rev 2459
Sample input for sat-2 and sat demos
deba [Tue, 26 Jun 2007 14:02:08 +0000] rev 2458
The mip column addition hack is necessary only for 4.16
deba [Fri, 15 Jun 2007 14:36:24 +0000] rev 2457
Improvments in min cost flow algorithms
- improved cycle cancelling
deba [Fri, 15 Jun 2007 14:32:48 +0000] rev 2456
Space reservation for SmartGraph
Doc improvments
deba [Fri, 15 Jun 2007 14:31:14 +0000] rev 2455
Using set() instead of assignment
alpar [Tue, 12 Jun 2007 14:34:28 +0000] rev 2454
Spellcheck
deba [Thu, 07 Jun 2007 20:07:29 +0000] rev 2453
Correction for multiple point on starting sweep line
alpar [Tue, 05 Jun 2007 17:30:52 +0000] rev 2452
Update the demo file of Circulation
alpar [Tue, 05 Jun 2007 17:29:46 +0000] rev 2451
Two new constructors added to dim2::BoundingBox
alpar [Tue, 05 Jun 2007 17:27:54 +0000] rev 2450
Negate the meaning of the delta parameter
alpar [Tue, 05 Jun 2007 17:24:35 +0000] rev 2449
Minor improvement in Tutorial
alpar [Tue, 05 Jun 2007 14:48:20 +0000] rev 2448
Bugfix and improvement in -tsp2 algorithm
deba [Tue, 05 Jun 2007 11:49:19 +0000] rev 2447
Delaunay triangulation
Faster geometric minimum spanning tree
alpar [Tue, 05 Jun 2007 10:59:16 +0000] rev 2446
A minimum spanning tree based TSP algorithm is added (-tsp2)
alpar [Tue, 05 Jun 2007 10:57:26 +0000] rev 2445
- Fix a serious bug in UEulerIt
- Add a conversion to UEdge
- Make some member funtions to be 'const'
deba [Fri, 11 May 2007 16:03:20 +0000] rev 2444
Patch in network simplex
Patch from Peter Kovacs
deba [Fri, 11 May 2007 16:02:53 +0000] rev 2443
Patch for retrieving reached/processed node in dijkstra, bfs and dfs
Patch from Peter Kovacs
deba [Thu, 10 May 2007 14:56:05 +0000] rev 2442
Bug fix
deba [Mon, 07 May 2007 18:19:55 +0000] rev 2441
Conformity to new GLPK interface
Hacking Mip without integer variables
deba [Mon, 07 May 2007 11:42:18 +0000] rev 2440
Various min cost flow solvers
Patch from Peter Kovacs
deba [Mon, 07 May 2007 08:49:57 +0000] rev 2439
Modified start() function in Dfs and Dijkstra classes to give back reached
edge/node.
Patch from Peter Kovacs
deba [Mon, 07 May 2007 08:48:40 +0000] rev 2438
Bug fix in Bfs class.
Patch from Peter Kovacs
deba [Mon, 07 May 2007 08:47:38 +0000] rev 2437
Small improvements in MinMeanCycle class.
Patch from Peter Kovacs
alpar [Tue, 24 Apr 2007 09:39:01 +0000] rev 2436
Integer parameters also convert to double
alpar [Fri, 20 Apr 2007 17:26:38 +0000] rev 2435
Fix the bug