Interface for algorithms for computing an upward planar subgraph. More...
#include <ogdf/upward/UpwardPlanarSubgraphModule.h>
Public Member Functions | |
UpwardPlanarSubgraphModule () | |
Initializes an upward planar subgraph module. More... | |
virtual | ~UpwardPlanarSubgraphModule () |
virtual void | call (const Graph &G, List< edge > &delEdges)=0 |
Computes set of edges delEdges which have to be deleted to obtain the upward planar subgraph. More... | |
void | callAndDelete (GraphCopy &GC, List< edge > &delOrigEdges) |
Makes GC upward planar by deleting edges. More... | |
void | operator() (const Graph &G, List< edge > &delEdges) |
Computes set of edges delEdges which have to be deleted to obtain the upward planar subgraph. More... | |
Interface for algorithms for computing an upward planar subgraph.
Definition at line 47 of file UpwardPlanarSubgraphModule.h.
|
inline |
Initializes an upward planar subgraph module.
Definition at line 50 of file UpwardPlanarSubgraphModule.h.
|
inlinevirtual |
Definition at line 53 of file UpwardPlanarSubgraphModule.h.
|
pure virtual |
Computes set of edges delEdges
which have to be deleted to obtain the upward planar subgraph.
Must be implemented by derived classes.
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.
GC | is a copy of the input graph. |
delOrigEdges | is the set of original edges whose copies have been deleted in GC . |
|
inline |
Computes set of edges delEdges
which have to be deleted to obtain the upward planar subgraph.
Definition at line 66 of file UpwardPlanarSubgraphModule.h.