Mon, 12 Feb 2007 10:27:03 +0000 deba Some spellcheck
Mon, 12 Feb 2007 10:25:56 +0000 deba Dijkstra could return the temporarly distance of the current node
Sun, 11 Feb 2007 16:34:51 +0000 deba Some bug fix
Wed, 07 Feb 2007 18:07:10 +0000 alpar Further doc improvements
Tue, 06 Feb 2007 19:16:26 +0000 alpar Two new distributions added:
Tue, 06 Feb 2007 19:09:17 +0000 alpar Doc improvements
Thu, 25 Jan 2007 14:38:55 +0000 alpar A push/relabel type max cardinality matching implementation.
Thu, 25 Jan 2007 14:36:21 +0000 alpar Doc improvements
Tue, 23 Jan 2007 13:13:39 +0000 deba Correction of the wrong base class
Tue, 23 Jan 2007 12:51:39 +0000 alpar Several doc improvements.
Mon, 22 Jan 2007 12:13:57 +0000 athos Small bug corrected.
Mon, 22 Jan 2007 10:22:14 +0000 alpar - Some bugfixes
Fri, 19 Jan 2007 17:27:22 +0000 alpar Spellcheck
Fri, 19 Jan 2007 17:15:15 +0000 alpar elevator.h: A class for handling item labels in push-relabel type algorithms
Fri, 12 Jan 2007 16:29:06 +0000 athos One important thing only: equality-type constraint can now be added to an lp. The prettyPrint functions are not too pretty yet, I accept.
Thu, 11 Jan 2007 22:08:18 +0000 deba Bug fix
Thu, 11 Jan 2007 21:58:30 +0000 deba G++-3.3 conform solution
Thu, 11 Jan 2007 21:35:14 +0000 deba Bug fix
Thu, 11 Jan 2007 21:27:51 +0000 deba Undirected minimum cut benchmarking
Thu, 11 Jan 2007 21:22:39 +0000 deba Make Hao-Orlin epsilon-safe
Thu, 11 Jan 2007 21:20:57 +0000 deba Bug fix
Thu, 11 Jan 2007 21:06:47 +0000 deba Changing implementation of undirected graphs
Thu, 11 Jan 2007 21:05:00 +0000 deba Adding two heuristics
Tue, 09 Jan 2007 11:42:43 +0000 athos Nothing serious.
Mon, 08 Jan 2007 10:39:59 +0000 deba New path concept and path structures
Fri, 05 Jan 2007 10:59:18 +0000 athos I only corrected some errors in the documentation.
Tue, 19 Dec 2006 15:53:42 +0000 deba MACROS for debug map usage
Tue, 19 Dec 2006 14:00:43 +0000 deba Bug fix
Mon, 18 Dec 2006 14:35:33 +0000 deba Easier inverse than m.inverse()[a] => m(a)
Mon, 18 Dec 2006 10:12:07 +0000 deba Better handling of inexact computation.