Bpp/Graph_problem
Min_cost_tension
Aggregation_binary
C++
 
 
DESCRIPTION
 

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.

 
SOURCE FILES
 

This section allows you to access the C++ source files of the module.

 
PARENT MODULE
 

This module is part of Bpp/Graph_problem/Min_cost_tension.

 
INCLUDED FILES
 

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.

  • <bpp/graph_problem/tension/algorithm.hpp>

  • <bpp/graph_problem/serial_parallel.hpp>

 
INTEGRATED NAMESPACES
 

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.

  • graphProblemSerialParallel

 
ALIASES
 

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

 
FUNCTIONS
 

Here are listed the functions provided by the module. To use one of them, you have to specify the namespace of the module.

 
CLASSES
 

Here are listed the classes provided by the module. To use one of them, you have to specify the namespace of the module.

 
clAggregationAlgo
 
 
Declaration

template <tdGraph> class clAggregationAlgo

 
Description

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.

 
Methods
 
clAggregationAlgoI
 
 
Declaration

template <tdGraph> class clAggregationAlgoI : public clAggregationAlgo<tuGraph>

 
Description

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.

 
Methods
 
clAggregationAlgoII
 
 
Declaration

template <tdGraph> class clAggregationAlgoII : public clAggregationAlgo<tuGraph>

 
Description

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).

 
Methods
 
clOptimalCase
 
 
Declaration

template <tdGraph> class clOptimalCase

 
Description

Represents an optimal case of the minimum binary cost tension problem in a serial-parallel graph.

 
Types
  • type std_vector(clArc<tuGraph> *) cpArcS
    Type of the list of arcs.

 
Attributes
  • 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.

 
Methods
 
clCaseFunction
 
 
Declaration

template <tdGraph> class clCaseFunction

 
Description

Represents the minimum cost function of the minimum binary cost tension problem in a serial-parallel graph.

 
Types
  • 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.

 
Attributes
  • 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.

 
Methods
 
clCaseIterator
 
 
Declaration

template <tdGraph> class clCaseIterator

 
Description

Represents an iterator on the list of optimal cases of a minimum cost function.

 
Types
  • type clOptimalCase<tuGraph> cpCase
    Type of an optimal case.

 
Methods
 
 
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).