kpeter [Sun, 13 Jan 2008 10:26:55 +0000] rev 2555
Reimplemented MinMeanCycle to be much more efficient.
The new version implements Howard's algorithm instead of Karp's algorithm and
it is at least 10-20 times faster on all the 40-50 random graphs we have tested.
alpar [Mon, 07 Jan 2008 17:07:40 +0000] rev 2554
Minor doc fix
alpar [Mon, 07 Jan 2008 13:09:48 +0000] rev 2553
Happy New Year to LEMON (+ better update-copyright-header script)
kpeter [Fri, 04 Jan 2008 00:47:08 +0000] rev 2552
Improved rename script to avoid "undirected digraph".
ladanyi [Mon, 31 Dec 2007 19:21:21 +0000] rev 2551
Include functional because of std::less.
deba [Sun, 30 Dec 2007 18:23:32 +0000] rev 2550
Changing degree of tournament tree
Bug fix in union find
Small efficiency improvment in bipartite matchings
deba [Sat, 29 Dec 2007 15:11:41 +0000] rev 2549
Test program for max weighted matchings
deba [Fri, 28 Dec 2007 11:00:51 +0000] rev 2548
Edmond's Blossom shrinking algroithm:
MaxWeightedMatching
MaxWeightedPerfectMatching
deba [Thu, 27 Dec 2007 13:40:16 +0000] rev 2547
Renaming state_enum to State
Removing "Type" suffix from typedefs
Moving implementation into the class definition
deba [Thu, 20 Dec 2007 15:21:22 +0000] rev 2546
Bug fix in erase