|
|||
|
|
|
|||
|
|
Interface of algorithms for the computation of c-planar subgraphs. More...
#include <ogdf/cluster/CPlanarSubgraphModule.h>
Inheritance diagram for ogdf::CPlanarSubgraphModule:Public Member Functions | |
| CPlanarSubgraphModule () | |
| Constructs a cplanar subgraph module. | |
| virtual | ~CPlanarSubgraphModule () |
| Destruction. | |
| ReturnType | call (const ClusterGraph &G, const EdgeArray< double > *pCost, List< edge > &delEdges) |
| Computes set of edges delEdges, which have to be deleted in order to get a c-planar subgraph. | |
| ReturnType | call (const ClusterGraph &G, List< edge > &delEdges) |
| Computes set of edges delEdges, which have to be deleted in order to get a c-planar subgraph. | |
| Public Member Functions inherited from ogdf::Module | |
| Module () | |
| Initializes a module. | |
| virtual | ~Module () |
| Public Member Functions inherited from ogdf::Timeouter | |
| Timeouter () | |
| timeout is turned of by default | |
| Timeouter (bool t) | |
| timeout is turned off (false) or on (true) (with 0 second) | |
| Timeouter (const Timeouter &t) | |
| Timeouter (double t) | |
| timeout is set to the given value (seconds) | |
| ~Timeouter () | |
| bool | isTimeLimit () const |
| returns whether any time limit is set or not | |
| Timeouter & | operator= (const Timeouter &t) |
| double | timeLimit () const |
| returns the current time limit for the call | |
| void | timeLimit (bool t) |
| shorthand to turn timelimit off or on (with 0 seconds) | |
| void | timeLimit (double t) |
| sets the time limit for the call (in seconds); <0 means no limit. | |
Protected Member Functions | |
| virtual ReturnType | doCall (const ClusterGraph &CG, const EdgeArray< double > *pCost, List< edge > &delEdges)=0 |
| Computes a c-planar subgraph. | |
Additional Inherited Members | |
| Public Types inherited from ogdf::Module | |
| enum class | ReturnType { Feasible , Optimal , NoFeasibleSolution , TimeoutFeasible , TimeoutInfeasible , Error } |
| The return type of a module. More... | |
| Static Public Member Functions inherited from ogdf::Module | |
| static bool | isSolution (ReturnType ret) |
Returns true iff ret indicates that the module returned a feasible solution. | |
| Protected Attributes inherited from ogdf::Timeouter | |
| double | m_timeLimit |
| Time limit for module calls (< 0 means no limit). | |
Interface of algorithms for the computation of c-planar subgraphs.
Definition at line 41 of file CPlanarSubgraphModule.h.
|
inline |
Constructs a cplanar subgraph module.
Definition at line 44 of file CPlanarSubgraphModule.h.
|
inlinevirtual |
Destruction.
Definition at line 47 of file CPlanarSubgraphModule.h.
|
inline |
Computes set of edges delEdges, which have to be deleted in order to get a c-planar subgraph.
Must be implemented by derived classes.
| G | is the clustergraph. |
| pCost | Assigns integral weight to all edges. We ask for a heavy subgraph. If set to nullptr all edges have a weight of 1. |
| delEdges | holds the edges not in the subgraph on return. |
Definition at line 74 of file CPlanarSubgraphModule.h.
|
inline |
Computes set of edges delEdges, which have to be deleted in order to get a c-planar subgraph.
Must be implemented by derived classes.
| G | is the clustergraph. |
| delEdges | holds the edges not in the subgraph on return. |
Definition at line 58 of file CPlanarSubgraphModule.h.
|
protectedpure virtual |
Computes a c-planar subgraph.
If delEdges is empty on return, the clustered graph G is c-planar- The actual algorithm call that must be implemented by derived classes!
| CG | is the given cluster graph. |
| pCost | Assigns integral weight to all edges. We ask for a heavy subgraph. If set to nullptr all edges have a weight of 1. |
| delEdges | holds the set of edges that have to be deleted. |
Implemented in ogdf::MaximumCPlanarSubgraph.
