Bpp/Graph_problem Tension Algorithm | C++ |
|  |
This module provides algorithms to solve 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/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 files listed below are needed by the implementation part of the module. But a module dependent of this module is not necessary 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. 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 clCompatibleTensionAlgo
Represents an algorithm to find a compatible tension in a graph. It is an abstract class. template <tdGraph> class clCompatibleTensionAlgoI : public clCompatibleTensionAlgo<tuGraph>
Represents an algorithm to find a compatible tension in a graph (method I: increasing cocycle). | clCompatibleTensionAlgoII | |
template <tdGraph> class clCompatibleTensionAlgoII : public clCompatibleTensionAlgo<tuGraph>
Represents an algorithm to find a compatible tension in a graph (method II: increasing cocycle). | clCompatibleTensionAlgoIII | |
template <tdGraph> class clCompatibleTensionAlgoIII : public clCompatibleTensionAlgo<tuGraph>
Represents an algorithm to find a compatible tension in a graph (method III: use of a shortest path algorithm). | clCompatibleTensionAlgoIV | |
template <tdGraph> class clCompatibleTensionAlgoIV : public clCompatibleTensionAlgo<tuGraph>
Represents an algorithm to find a compatible tension in a graph (method IV: use of a shortest path algorithm). | | 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). |
|
|