Major improvements in NetworkSimplex.

Main changes:
- Use -potenital[] instead of potential[] to conform to the usual
terminology.
- Use function parameter instead of #define commands to select pivot rule.
- Use much faster implementation for the candidate list pivot rule.
It is about 5-20 times faster now.
- Add a new pivot rule called "Limited Search" that is a modified
version of "Block Search". It is about 25 percent faster on rather
sparse graphs.
- By default "Limited Search" is used for sparse graphs and
"Block Search" is used otherwise. This combined method is the most
efficient on every input class.
- Change the name of private members to start with "_".
- Change the name of function parameters not to start with "_".
- Remove unnecessary documentation for private members.
- Many doc improvements.

Source: lemon

Section: unknown

Priority: optional

Maintainer: LEMON Development Team <etik-ol@cs.elte.hu>

Build-Depends: debhelper (>= 4.0.0), glpk, libgnomecanvasmm-2.6-dev

Standards-Version: 3.6.1

Package: lemon

Architecture: any

Depends: ${shlibs:Depends}, ${misc:Depends}, libgnomecanvasmm-2.6

Description: A C++ template library aimed at combinatorial optimization tasks.

 LEMON stands for Library of Efficient Models and

 Optimization in Networks. It is a C++ template

 library aimed at combinatorial optimization tasks,

 especially those working with graphs and networks.