Bpp/Graph_problem Min_cost_tension Aggregation_binary | C++ |
|  |
This module implements an algorithm we call "aggregation" to solve the minimum cost tension problem in serial-parallel graphs. The cost functions of the arcs in the graph must be binary as defined by the clBinaryArcData class of the Structure module. This section allows you to access the C++ source files of the module. This module is part of Bpp/Graph_problem/Min_cost_tension . The files listed below are included in the interface part of the module. So any module dependent of this module is also dependent of the files listed here. The namespaces listed below are integrated in this module. That means any element declared in one of those namespaces can now be directly used by or from this module. The aliases listed below are only used internally by the interface. They are here just to lighten the writing of certain declarations. Never use them, they are local to the interface and can not be used outside of it. tdGraph = class prArcData,class prNodeData
tuGraph = prArcData,prNodeData
Here are listed the functions provided by the module. To use one of them, you have to specify the namespace of the module. Here are listed the classes provided by the module. To use one of them, you have to specify the namespace of the module. template <tdGraph> class clAggregationAlgo
Represents an algorithm to solve the minimum binary cost tension problem in a serial-parallel graph using the aggregation technique. It is an abstract class. template <tdGraph> class clAggregationAlgoI : public clAggregationAlgo<tuGraph>
Represents an algorithm to solve the minimum binary cost tension problem in a serial-parallel graph using the aggregation technique with a raw inf-convolution computation (approach I). Not fully implemented yet. template <tdGraph> class clAggregationAlgoII : public clAggregationAlgo<tuGraph>
Represents an algorithm to solve the minimum binary cost tension problem in a serial-parallel graph using the aggregation technique with a case-oriented inf-convolution computation (approach II). template <tdGraph> class clOptimalCase
Represents an optimal case of the minimum binary cost tension problem in a serial-parallel graph. cpArcS arcs() List of the arcs set to their optimal tension in the actual case. Reading and writing access.
tyReal cost() Cost of the case. Reading and writing access.
tyReal minimum() Minimum main tension such that the case remains feasible. Reading and writing access.
tyReal maximum() Maximum main tension such that the case remains feasible. Reading and writing access.
template <tdGraph> class clCaseFunction
Represents the minimum cost function of the minimum binary cost tension problem in a serial-parallel graph. type clOptimalCase<tuGraph> cpCase Type of an optimal case.
type std_vector(cpCase *) cpCaseS Type of a subset of cases.
type clCaseIterator<tuGraph> cpCaseIterator Type of an iterator on the whole list of cases.
tyReal cost() Minimum cost of the function. Reading and writing access.
tyReal minimum() Minimum main tension possible for the problem. Reading and writing access.
tyReal maximum() Maximum main tension possible for the problem. Reading and writing access.
template <tdGraph> class clCaseIterator
Represents an iterator on the list of optimal cases of a minimum cost function. | | Copyright (c) 1999-2016 - Bruno Bachelet - bruno@nawouak.net - http://www.nawouak.net | Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation. See this license for more details (http://www.gnu.org). |
|
| |