Bpp/Graph_problem Min_cost_tension Conforming_convex | C++ |
|  |
This module implements the conforming algorithm to solve the minimum cost tension problem in graphs. The cost functions of the arcs in the graph must be convex as defined by the clConvexArcData1 or clConvexArcData2 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 classes provided by the module. To use one of them, you have to specify the namespace of the module. template <tdGraph> class clSolveAlgo : public clConvexSolver<tuGraph>
Represents an algorithm to solve the minimum cost tension problem in a graph using the conforming method. It is an abstract class. template <tdGraph> class clSolveAlgoI : public clSolveAlgo<tuGraph>
Represents an algorithm to solve the minimum cost tension problem in a graph using the conforming method (version I). template <tdGraph> class clSolveAlgoII : public clSolveAlgo<tuGraph>
Represents an algorithm to solve the minimum cost tension problem in a graph using the conforming method (version II). template <tdGraph> class clSolveAlgoIII : public clSolveAlgo<tuGraph>
Represents an algorithm to solve the minimum cost tension problem in a graph using the conforming method (version III). | | 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). |
|
|