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.
3 * This file is a part of LEMON, a generic C++ optimization library
5 * Copyright (C) 2003-2008
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
21 \page Tutorial LEMON Tutorial
23 <H2>Table of Contents</H2>
25 <OL style="padding-bottom: 60px">
27 <LI>\ref getting_started
32 <LI>\ref basic_concepts
34 <LI>\ref basic_ListGraph
37 <LI>\ref lemon_file_format
39 <LI>\ref read_write_bg
44 <LI>\ref algo_dijkstra
51 <LI>Special Purpose Maps
54 <LI>Miscellaneous Tool
57 <LI>Simulated Annealing
61 \section intro Introduction
62 In this tutorial we try to show you as many aspects of LEMON as possible. From
63 the basics to the very advanced or highly optimized tools. The given examples
64 are all available in \c demo directory, so feel free to look at them after the