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.
4 RootName: @lemon.cs.elte.hu/lemon:$SOFTWAREVERSION
5 DisplayName: Lemon Library
7 Maintainer: The LEMON Developers - http://lemon.cs.elte.hu/
8 Packager: Alpar Juttner <alpar@cs.elte.hu>
10 SoftwareVersion: @VERSION@
11 AutopackageTarget: 1.2
13 # Only uncomment InterfaceVersion if your package exposes interfaces to other software,
14 # for instance if it includes DSOs or python/perl modules. See the developer guide for more info,
15 # or ask on autopackage-dev if you don't understand interface versioning in autopackage.
22 LEMON stands for Library of Efficient Models and Optimization in Networks.
23 It is a C++ template library aimed at combinatorial optimization tasks,
24 primaliry those involved in working with graphs.
37 require @lemon.cs.elte.hu/GLPK:4.11
40 # Put your installation script here
45 # Usually just the following line is enough to uninstall everything