deba [Thu, 11 Jan 2007 22:08:18 +0000] rev 2344
Bug fix
deba [Thu, 11 Jan 2007 21:58:30 +0000] rev 2343
G++-3.3 conform solution
deba [Thu, 11 Jan 2007 21:35:14 +0000] rev 2342
Bug fix
deba [Thu, 11 Jan 2007 21:27:51 +0000] rev 2341
Undirected minimum cut benchmarking
deba [Thu, 11 Jan 2007 21:22:39 +0000] rev 2340
Make Hao-Orlin epsilon-safe
deba [Thu, 11 Jan 2007 21:20:57 +0000] rev 2339
Bug fix
deba [Thu, 11 Jan 2007 21:06:47 +0000] rev 2338
Changing implementation of undirected graphs
slightly faster, 10% speed-up
deba [Thu, 11 Jan 2007 21:05:00 +0000] rev 2337
Adding two heuristics
Based on:
http://www.avglab.com/andrew/pub/neci-tr-96-132.ps
athos [Tue, 09 Jan 2007 11:42:43 +0000] rev 2336
Nothing serious.
deba [Mon, 08 Jan 2007 10:39:59 +0000] rev 2335
New path concept and path structures
TODO: BellmanFord::negativeCycle()
athos [Fri, 05 Jan 2007 10:59:18 +0000] rev 2334
I only corrected some errors in the documentation.
deba [Tue, 19 Dec 2006 15:53:42 +0000] rev 2333
MACROS for debug map usage
deba [Tue, 19 Dec 2006 14:00:43 +0000] rev 2332
Bug fix
deba [Mon, 18 Dec 2006 14:35:33 +0000] rev 2331
Easier inverse than m.inverse()[a] => m(a)
deba [Mon, 18 Dec 2006 10:12:07 +0000] rev 2330
Better handling of inexact computation.
We do not use tolerance for excess, just for edges
deba [Tue, 12 Dec 2006 13:35:52 +0000] rev 2329
clone => build renaming