Files @ r687:6c408d864fa1

Location: LEMON/LEMON-official/doc/dirs.dox

Load file history 
r687:6c408d864fa1
1.8 KiB
text/plain
Show annotation Show as raw Download as raw
gravatar
kpeter (Peter Kovacs)
Support negative costs and bounds in NetworkSimplex (#270) * The interface is reworked to support negative costs and bounds. - ProblemType and problemType() are renamed to SupplyType and supplyType(), see also #234. - ProblemType type is introduced similarly to the LP interface. - 'bool run()' is replaced by 'ProblemType run()' to handle unbounded problem instances, as well. - Add INF public member constant similarly to the LP interface. * Remove capacityMap() and boundMaps(), see also #266. * Update the problem definition in the MCF module. * Remove the usage of Circulation (and adaptors) for checking feasibility. Check feasibility by examining the artifical arcs instead (after solving the problem). * Additional check for unbounded negative cycles found during the algorithm (it is possible now, since negative costs are allowed). * Fix in the constructor (the value types needn't be integer any more), see also #254. * Improve and extend the doc. * Rework the test file and add test cases for negative costs and bounds.
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Copyright (C) 2003-2009

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */



/**

\dir demo

\brief A collection of demo applications.



This directory contains several simple demo applications, mainly

for educational purposes.

*/



/**

\dir doc

\brief Auxiliary (and the whole generated) documentation.



This directory contains some auxiliary pages and the whole generated

documentation.

*/



/**

\dir test

\brief Test programs.



This directory contains several test programs that check the consistency

of the code.

*/



/**

\dir tools

\brief Some useful executables.



This directory contains the sources of some useful complete executables.

*/



/**

\dir lemon

\brief Base include directory of LEMON.



This is the base directory of LEMON includes, so each include file must be

prefixed with this, e.g.

\code

#include<lemon/list_graph.h>

#include<lemon/dijkstra.h>

\endcode

*/



/**

\dir concepts

\brief Concept descriptors and checking classes.



This directory contains the concept descriptors and concept checking tools.

For more information see the \ref concept "Concepts" module.

*/



/**

\dir bits

\brief Auxiliary tools for implementation.



This directory contains some auxiliary classes for implementing graphs,

maps and some other classes.

As a user you typically don't have to deal with these files.

*/