Bpp/Graph_problem
Min_cost_tension
Linear_system
C++
 
 
DESCRIPTION
 

This module provides facilities to solve the minimum cost tension problem in graphs using linear program modeling.

 
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/min_cost_tension/algorithm.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.

  • graphProblemMinCostTensionAlgorithm

 
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

 
CLASSES
 

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

 
clBinarySolveAlgo
 
 
Declaration

template <tdGraph> class clBinarySolveAlgo

 
Description

Represents an algorithm to solve the minimum binary cost tension problem in a graph using a linear program modeling. It is an abstract class. The cost functions of the arcs in the graph must be binary as defined by the clBinaryArcData class of the Structure module.

 
Methods
 
clDiscreteSolveAlgo
 
 
Declaration

template <tdGraph> class clDiscreteSolveAlgo

 
Description

Represents an algorithm to solve the minimum cost discrete tension problem in a graph using a linear program modeling. It is an abstract class. The cost functions of the arcs in the graph must be linear as defined by the clDiscreteArcData class of the Structure module.

 
Methods
 
clLinearSolveAlgo
 
 
Declaration

template <tdGraph> class clLinearSolveAlgo

 
Description

Represents an algorithm to solve the minimum linear cost tension problem in a graph using a linear program modeling. It is an abstract class. The cost functions of the arcs in the graph must be linear as defined by the clLinearArcData class of the Structure module.

 
Methods
 
clBinarySolveAlgoI
 
 
Declaration

template <tdGraph> class clBinarySolveAlgoI : public clBinarySolveAlgo<tuGraph>

 
Description

Represents an algorithm to solve the minimum cost tension problem with binary costs in a graph using the linear program modeling I (using a cycle base).

 
Attributes
  • tyBoolean shortCycles()
    Indicates if short cycles must be used for the base. Reading access only.

 
Methods
 
clDiscreteSolveAlgoI
 
 
Declaration

template <tdGraph> class clDiscreteSolveAlgoI : public clDiscreteSolveAlgo<tuGraph>

 
Description

Represents an algorithm to solve the minimum cost discrete tension problem in a graph using the linear program modeling I (using a cycle base).

 
Attributes
  • tyBoolean shortCycles()
    Indicates if short cycles must be used for the base. Reading access only.

 
Methods
 
clLinearSolveAlgoI
 
 
Declaration

template <tdGraph> class clLinearSolveAlgoI : public clLinearSolveAlgo<tuGraph>

 
Description

Represents an algorithm to solve the minimum cost tension problem with linear costs in a graph using the linear program modeling I (using a cycle base).

 
Attributes
  • tyBoolean shortCycles()
    Indicates if short cycles must be used for the base. Reading access only.

 
Methods
 
clBinarySolveAlgoII
 
 
Declaration

template <tdGraph> class clBinarySolveAlgoII : public clBinarySolveAlgo<tuGraph>

 
Description

Represents an algorithm to solve the minimum cost tension problem with binary costs in a graph using the linear program modeling II (using the incidence matrix).

 
Methods
 
clDiscreteSolveAlgoII
 
 
Declaration

template <tdGraph> class clDiscreteSolveAlgoII : public clDiscreteSolveAlgo<tuGraph>

 
Description

Represents an algorithm to solve the minimum cost discrete tension problem in a graph using the linear program modeling II (using the incidence matrix).

 
Methods
 
clLinearSolveAlgoII
 
 
Declaration

template <tdGraph> class clLinearSolveAlgoII : public clLinearSolveAlgo<tuGraph>

 
Description

Represents an algorithm to solve the minimum cost tension problem with linear costs in a graph using the linear program modeling II (using a cycle base).

 
Attributes
  • tyBoolean shortCycles()
    Indicates if short cycles must be used for the base. Reading access only.

 
Methods
 
clLinearSolveAlgoIII
 
 
Declaration

template <tdGraph> class clLinearSolveAlgoIII : public clLinearSolveAlgo<tuGraph>

 
Description

Represents an algorithm to solve the minimum linear cost tension problem with linear costs in a graph using the linear program modeling III (using the incidence matrix).

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