Balazs Dezso <deba@inf.elte.hu> [Tue, 28 Apr 2009 12:54:59 +0200] rev 629
 
Fix Makefile.am EXTRA_DIST (#276)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 28 Apr 2009 14:01:00 +0100] rev 628
 
Merge
Akos Ladanyi <ladanyi@tmit.bme.hu> [Tue, 28 Apr 2009 13:51:34 +0100] rev 627
 
Merge and extend the fix of #275
Alpar Juttner <alpar@cs.elte.hu> [Sun, 26 Apr 2009 16:36:23 +0100] rev 626
 
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 26 Apr 2009 16:44:53 +0200] rev 625
 
Modify the interface of MinCostArborescence + improvements (#267)
 - Rename arborescenceValue() to arborescenceCost().
 - Rename DefXyz template named paramaters to SetXyz.
 - Rearrange public functions (for better doc).
 - Doc improvements.
 - Extend the test file with interface checking.
Alpar Juttner <alpar@cs.elte.hu> [Sat, 25 Apr 2009 17:51:09 +0100] rev 624
 
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 25 Apr 2009 02:12:41 +0200] rev 623
 
Modify the interface of Suurballe (#266, #181)
 - Move the parameters s and t from the constructor to the run()
   function. It makes the interface capable for multiple run(s,t,k)
   calls (possible improvement in the future) and it is more similar
   to Dijkstra.
 - Simliarly init() and findFlow(k) were replaced by init(s) and
   findFlow(t,k). The separation of parameters s and t is for the
   future plans of supporting multiple targets with one source node.
   For more information see #181.
 - LEMON_ASSERT for the Length type (check if it is integer).
 - Doc improvements.
 - Rearrange query functions.
 - Extend test file.
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 25 Apr 2009 18:25:59 +0200] rev 622
 
Support infinite bounds in Circulation + fixes (#270, #266)
 - Support infinite capacities.
 - Bug fix in upperMap().
 - Fixes and improvements in the documentation.
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 23 Apr 2009 07:30:40 +0100] rev 621
 
FindCOIN for CMake (#256)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 23 Apr 2009 07:29:50 +0100] rev 620
 
FindCPLEX for CMake (#256)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 23 Apr 2009 07:28:56 +0100] rev 619
 
FindGLPK improvements (#256)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 24 Apr 2009 12:12:14 +0100] rev 618
 
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 11:54:48 +0200] rev 617
 
Fix and uniform the usage of Graph and Parent typedefs (#268)
 - Rename Graph typedefs to GraphType in the implementation of graph
   maps and MapExtender to prevent conflicts (especially using VS).
   They are not public.
 - Make Parent typedefs private in all classes.
 - Replace Digraph with Graph in some places
   (fix faulty renamings of the script).
 - Use Graph and Digraph typedefs (more) consequently.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 10:15:33 +0200] rev 616
 
VS compatibility fix (#268)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 12:23:53 +0200] rev 615
 
Exploit the changes of #190 in MCF test file (#234, #190)