Thu, 11 Jan 2007 21:06:47 +0000Changing implementation of undirected graphs
deba [Thu, 11 Jan 2007 21:06:47 +0000] rev 2338
Changing implementation of undirected graphs
slightly faster, 10% speed-up

Thu, 11 Jan 2007 21:05:00 +0000Adding two heuristics
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

Tue, 09 Jan 2007 11:42:43 +0000Nothing serious.
athos [Tue, 09 Jan 2007 11:42:43 +0000] rev 2336
Nothing serious.

Mon, 08 Jan 2007 10:39:59 +0000New path concept and path structures
deba [Mon, 08 Jan 2007 10:39:59 +0000] rev 2335
New path concept and path structures

TODO: BellmanFord::negativeCycle()

Fri, 05 Jan 2007 10:59:18 +0000I only corrected some errors in the documentation.
athos [Fri, 05 Jan 2007 10:59:18 +0000] rev 2334
I only corrected some errors in the documentation.

Tue, 19 Dec 2006 15:53:42 +0000MACROS for debug map usage
deba [Tue, 19 Dec 2006 15:53:42 +0000] rev 2333
MACROS for debug map usage

Tue, 19 Dec 2006 14:00:43 +0000Bug fix
deba [Tue, 19 Dec 2006 14:00:43 +0000] rev 2332
Bug fix

Mon, 18 Dec 2006 14:35:33 +0000Easier inverse than m.inverse()[a] => m(a)
deba [Mon, 18 Dec 2006 14:35:33 +0000] rev 2331
Easier inverse than m.inverse()[a] => m(a)

Mon, 18 Dec 2006 10:12:07 +0000Better handling of inexact computation.
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

Tue, 12 Dec 2006 13:35:52 +0000clone => build renaming
deba [Tue, 12 Dec 2006 13:35:52 +0000] rev 2329
clone => build renaming