Bpp/Graph_problem Min_cost_tension Random_generation | C++ |
|  |
This module provides facilities to generate random minimum cost tension problems in graphs. 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. template <tdGraph> inline void generateConvexGraph1(clGraph<tuGraph> & agGraph,tyCardinal agNbNode,tyCardinal agNbArc,tyInteger agPotentialScale,tyCardinal agFlexibility,tyInteger agAccelerationScale) Generates randomly a minimum cost tension problem with given potential scale and flexibility and a given cost acceleration scale, in a graph with given numbers of arcs and nodes. The cost functions of the arcs are as defined by the clConvexArcData1 class of the Structure module.
template <tdGraph> inline void generateDiscreteGraph(clGraph<tuGraph> & agGraph,tyCardinal agNbNode,tyCardinal agNbArc,tyInteger agPotentialScale,tyCardinal agTensionCardinality,tyInteger agUnitCostScale) Generates randomly a minimum cost tension problem with a given potential scale, a given cardinality for the feasible tension sets and a given unit cost scale, in a graph with given numbers of arcs and nodes. The cost functions of the arcs are as defined by the clDiscreteArcData class of the Structure module.
template <tdGraph> inline void generateLinearGraph(clGraph<tuGraph> & agGraph,tyCardinal agNbNode,tyCardinal agNbArc,tyInteger agPotentialScale,tyCardinal agFlexibility,tyInteger agUnitCostScale) Generates randomly a minimum cost tension problem with given potential scale and flexibility and a given unit cost scale, in a graph with given numbers of arcs and nodes. The cost functions of the arcs are as defined by the clLinearArcData class of the Structure module.
template <tdGraph> inline void generatePiecewiseGraph(clGraph<tuGraph> & agGraph,tyCardinal agNbNode,tyCardinal agNbArc,tyInteger agPotentialScale,tyCardinal agFlexibility,tyInteger agUnitCostScale,tyCardinal agNbPiece) Generates randomly a minimum cost tension problem with given potential scale and flexibility and a given unit cost scale, in a graph with given numbers of arcs and nodes. The cost functions of the arcs are piecewise linear as defined by the clPiecewiseArcData class of the Structure module.
template <tdGraph> inline void generateConvexSerialParallelGraph(clGraph<tuGraph> & agGraph,tyCardinal agNbNode,tyCardinal agNbOrganizingArc,tyCardinal agNbDisruptingArc,tyInteger agPotentialScale,tyCardinal agFlexibility,tyInteger agAcceleration,std_vector(clBinaryTree<clSerialParallelData<tuGraph> > *) * agTreeS) Generates randomly a minimum cost tension problem (with a serial-parallel graph that can be disrupted) with given potential scale and flexibility and a given cost acceleration scale, in a graph with given numbers of arcs (number for the organized serial-parallel graph and number for the disruption) and nodes. The cost functions of the arcs are as defined by the clConvexArcData1 class of the Structure module. If not null, the last parameter is a pointer to a vector of SP-components representing the generated graph, that is filled during the generation process. The last parameter is null by default.
template <tdGraph> inline void generateDiscreteSerialParallelGraph(clGraph<tuGraph> & agGraph,tyCardinal agNbNode,tyCardinal agNbOrganizingArc,tyCardinal agNbDisruptingArc,tyInteger agPotentialScale,tyCardinal agTensionCardinality,tyInteger agUnitCostScale) Generates randomly a minimum cost tension problem (with a serial-parallel graph that can be disrupted) with a given potential scale, a given cardinality for the feasible tension sets and a given unit cost scale, in a graph with given numbers of arcs (number for the organized serial-parallel graph and number for the disruption) and nodes. The cost functions of the arcs are as defined by the clDiscreteArcData class of the Structure module.
template <tdGraph> inline void generateLinearSerialParallelGraph(clGraph<tuGraph> & agGraph,tyCardinal agNbNode,tyCardinal agNbOrganizingArc,tyCardinal agNbDisruptingArc,tyInteger agPotentialScale,tyCardinal agFlexibility,tyInteger agUnitCostScale,std_vector(clBinaryTree<clSerialParallelData<tuGraph> > *) * agTreeS) Generates randomly a minimum cost tension problem (with a serial-parallel graph that can be disrupted) with given potential scale and flexibility and a given unit cost scale, in a graph with given numbers of arcs (number for the organized serial-parallel graph and number for the disruption) and nodes. The cost functions of the arcs are as defined by the clLinearArcData class of the Structure module. If not null, the last parameter is a pointer to a vector of SP-components representing the generated graph, that is filled during the generation process. The last parameter is null by default.
template <tdGraph> inline void generatePiecewiseSerialParallelGraph(clGraph<tuGraph> & agGraph,tyCardinal agNbNode,tyCardinal agNbOrganizingArc,tyCardinal agNbDisruptingArc,tyInteger agPotentialScale,tyCardinal agFlexibility,tyInteger agUnitCostScale,tyCardinal agNbPiece,std_vector(clBinaryTree<clSerialParallelData<tuGraph> > *) * agTreeS) Generates randomly a minimum cost tension problem (with a serial-parallel graph that can be disrupted) with given potential scale and flexibility and a given unit cost scale, in a graph with given numbers of arcs (number for the organized serial-parallel graph and number for the disruption) and nodes. The cost functions of the arcs are piecewise linear as defined by the clLinearArcData class of the Structure module. If not null, the last parameter is a pointer to a vector of SP-components representing the generated graph, that is filled during the generation process. The last parameter is null by default.
template <tdGraph> void generateConvexGraph2(clGraph<tuGraph> & agGraph,tyCardinal agNbNode,tyCardinal agNbArc,tyInteger agPotentialScale,tyCardinal agFlexibility) Generates randomly a minimum cost tension problem with given potential scale and flexibility, in a graph with given numbers of arcs and nodes. The cost functions of the arcs are as defined by the clConvexArcData2 class of the Structure module.
| | 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). |
|
| |