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
alpar [Fri, 20 Apr 2007 17:24:05 +0000] rev 2434
Test the repository checking service
alpar [Fri, 20 Apr 2007 16:22:03 +0000] rev 2433
Fix the test bug
ladanyi [Fri, 20 Apr 2007 15:53:06 +0000] rev 2432
Sorry...
ladanyi [Fri, 20 Apr 2007 15:51:54 +0000] rev 2431
fix to compile with gcc 4.1.2
alpar [Fri, 20 Apr 2007 14:50:42 +0000] rev 2430
Test broken repository warning
deba [Fri, 20 Apr 2007 14:49:21 +0000] rev 2429
Renaming topology doxygen group