A maximal planar subgraph algorithm using planarity testing.
More...
#include <ogdf/upward/UpwardPlanarSubgraphSimple.h>
A maximal planar subgraph algorithm using planarity testing.
Definition at line 41 of file UpwardPlanarSubgraphSimple.h.
◆ UpwardPlanarSubgraphSimple()
ogdf::UpwardPlanarSubgraphSimple::UpwardPlanarSubgraphSimple |
( |
| ) |
|
|
inline |
◆ ~UpwardPlanarSubgraphSimple()
ogdf::UpwardPlanarSubgraphSimple::~UpwardPlanarSubgraphSimple |
( |
| ) |
|
|
inline |
◆ call() [1/2]
virtual void ogdf::UpwardPlanarSubgraphSimple::call |
( |
const Graph & |
G, |
|
|
List< edge > & |
delEdges |
|
) |
| |
|
overridevirtual |
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. |
Implements ogdf::UpwardPlanarSubgraphModule.
◆ call() [2/2]
void ogdf::UpwardPlanarSubgraphSimple::call |
( |
GraphCopy & |
GC, |
|
|
List< edge > & |
delEdges |
|
) |
| |
◆ checkAcyclic()
◆ dfsBuildSpanningTree()
void ogdf::UpwardPlanarSubgraphSimple::dfsBuildSpanningTree |
( |
node |
v, |
|
|
SListPure< edge > & |
treeEdges, |
|
|
NodeArray< bool > & |
visited |
|
) |
| |
|
private |
The documentation for this class was generated from the following file: