lemon/cycle_canceling.h
Thu, 17 Oct 2013 09:29:37 +0200 Fix debug checking + simplify lower bound handling (#478)
Fri, 09 Aug 2013 11:28:17 +0200 Apply unify-sources.sh to the source tree
Tue, 06 Aug 2013 05:48:18 +0200 Use latex formatting for non-trivial O() expressions (#463)
Tue, 06 Aug 2013 05:38:49 +0200 Use m instead of e for denoting the number of arcs/edges (#463)
Tue, 30 Jul 2013 15:24:45 +0200 Merge #454
Sat, 16 Mar 2013 16:20:41 +0100 Debug checking for capacity bounds in min cost flow algorithms (#454)
Mon, 18 Mar 2013 17:41:19 +0100 Use doxygen's own bibtex support (#456)
Sat, 16 Mar 2013 13:14:35 +0100 Minor fixes and improvements in the doc (#459)
Thu, 15 Nov 2012 07:17:48 +0100 Ensure strongly polynomial running time for CycleCanceling (#436)
Mon, 30 Jan 2012 23:24:40 +0100 Doc improvements for min cost flow algorithms (#437)
Mon, 10 Jan 2011 09:34:50 +0100 Merge
Sat, 08 Jan 2011 16:11:48 +0100 Minor doc improvements
Sun, 09 Jan 2011 16:51:14 +0100 Various doc improvements (#406)
Sat, 06 Mar 2010 14:35:12 +0000 Unify the sources (#339)
Sat, 13 Mar 2010 22:01:38 +0100 Rename min mean cycle classes and their members (#179)
Fri, 26 Feb 2010 14:00:20 +0100 Merge #340
Sat, 20 Feb 2010 18:39:03 +0100 New heuristics for MCF algorithms (#340)
Wed, 10 Feb 2010 19:05:20 +0100 Handle graph changes in the MCF algorithms (#327)
Fri, 13 Nov 2009 00:37:55 +0100 Rename a private type in MCF classes (#180)
Fri, 13 Nov 2009 00:11:11 +0100 Add citations to CycleCanceling (#180, #184)
Fri, 13 Nov 2009 00:10:33 +0100 Entirely rework cycle canceling algorithms (#180)
Fri, 13 Nov 2009 00:09:35 +0100 Port cycle canceling algorithms from SVN -r3524 (#180)