Interface for algorithms for computing an upward planar subgraph.
More...
#include <ogdf/module/UpwardPlanarSubgraphModule.h>
List of all members.
Detailed Description
Interface for algorithms for computing an upward planar subgraph.
Definition at line 62 of file UpwardPlanarSubgraphModule.h.
Constructor & Destructor Documentation
| ogdf::UpwardPlanarSubgraphModule::UpwardPlanarSubgraphModule |
( |
| ) |
|
|
inline |
| virtual ogdf::UpwardPlanarSubgraphModule::~UpwardPlanarSubgraphModule |
( |
| ) |
|
|
inlinevirtual |
Member Function Documentation
| virtual void ogdf::UpwardPlanarSubgraphModule::call |
( |
const Graph & |
G, |
|
|
List< edge > & |
delEdges |
|
) |
| |
|
pure virtual |
Computes set of edges delEdges which have to be deleted to obtain the upward planar subgraph.
Must be implemented by derived classes.
- Parameters:
-
| G | is the input graph. |
| delEdges | is assigned the set of edges which have to be deleted in G to obtain the upward planar subgraph. |
Implemented in ogdf::UpwardPlanarSubgraphSimple.
| void ogdf::UpwardPlanarSubgraphModule::callAndDelete |
( |
GraphCopy & |
GC, |
|
|
List< edge > & |
delOrigEdges |
|
) |
| |
Makes GC upward planar by deleting edges.
- Parameters:
-
| GC | is a copy of the input graph. |
| delOrigEdges | is the set of original edges whose copies have been deleted in GC. |
| void ogdf::UpwardPlanarSubgraphModule::operator() |
( |
const Graph & |
G, |
|
|
List< edge > & |
delEdges |
|
) |
| |
|
inline |
Computes set of edges delEdges which have to be deleted to obtain the upward planar subgraph.
Definition at line 82 of file UpwardPlanarSubgraphModule.h.
The documentation for this class was generated from the following file:
Inheritance diagram for ogdf::UpwardPlanarSubgraphModule:
