Peter Kovacs <kpeter@inf.elte.hu> [Wed, 13 May 2009 10:42:26 +0200] rev 717
Add artificial addNode() function to the arc/edge set classes
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 12 May 2009 20:08:23 +0200] rev 716
Avoid Intel C++ Compiler warnings
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 12 May 2009 17:57:49 +0200] rev 715
Disable Visual Studio warning C4503
Alpar Juttner <alpar@cs.elte.hu> [Tue, 12 May 2009 15:55:00 +0100] rev 714
Add lemon/config.h.cmake to the tarball
Alpar Juttner <alpar@cs.elte.hu> [Tue, 12 May 2009 15:02:18 +0100] rev 713
Resolve GCC-4.4 warnings & fix ambiguous op=() in graph_components.h
Alpar Juttner <alpar@cs.elte.hu> [Tue, 12 May 2009 11:49:13 +0100] rev 712
Update NEWS file
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 12 May 2009 12:08:06 +0200] rev 711
Extend min cost flow test file + check dual costs (#291)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 12 May 2009 12:06:40 +0200] rev 710
Fix the GEQ/LEQ handling in NetworkSimplex + improve doc (#291)
- Fix the optimality conditions for the GEQ/LEQ form.
- Fix the initialization of the algortihm. It ensures correct
solutions and it is much faster for the inequality forms.
- Fix the pivot rules to search all the arcs that have to be
allowed to get in the basis.
- Better block size for the Block Search pivot rule.
- Improve documentation of the problem and move it to a
separate page.
Alpar Juttner <alpar@cs.elte.hu> [Mon, 11 May 2009 16:38:21 +0100] rev 709
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 09 May 2009 16:47:26 +0200] rev 708
Remove bits/base_extender.h, which is not used at all (#288)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 11 May 2009 17:04:40 +0200] rev 707
Move list and edge sets to the graph module (#290)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 11 May 2009 15:48:37 +0100] rev 706
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 11 May 2009 16:42:42 +0200] rev 705
Change the explanation of the acronym LEMON (#289)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 09 May 2009 16:39:59 +0200] rev 704
Change Graph::Edge -> Graph::Arc inheritance to conversion (#283)
Balazs Dezso <deba@inf.elte.hu> [Thu, 07 May 2009 10:46:49 +0200] rev 703
Change Undirector::Edge -> Undirector::Arc inheritance to conversion (#283)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 08 May 2009 16:21:06 +0100] rev 702
Fix the faulty merge of unify-sources.sh in [586b65073025]
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 08 May 2009 13:15:29 +0200] rev 701
Doc fixes for lgf-gen (#282)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 07 May 2009 12:21:00 +0100] rev 700
Merge
Alpar Juttner <alpar@cs.elte.hu> [Thu, 07 May 2009 12:19:41 +0100] rev 699
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 07 May 2009 02:07:59 +0200] rev 698
Small doc improvements (#257)
Balazs Dezso <deba@inf.elte.hu> [Thu, 07 May 2009 11:53:49 +0200] rev 697
Fix glp_prob definition (#286)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 06 May 2009 14:46:05 +0200] rev 696
Add a test file for the connectivity functions (#285)
The Euler tools have a separate test file.
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 06 May 2009 14:44:05 +0200] rev 695
Doc improvements and fixes for connectivity tools (#285)
And add loopFree(), parallelFree(), simpleGraph() to the module doc.
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 06 May 2009 14:37:44 +0200] rev 694
Bug fixes in connectivity.h (#285)
- Bug fix in tree().
- Rename simpleDigraph() to simpleGraph() (it works for both
directed and undirected graphs).
- Possibly faster implementation for parallelFree() and
simpleGraph().