ogdf::UpwardPlanarSubgraphSimple Class Reference

A maximal planar subgraph algorithm using planarity testing. More...

#include <ogdf/upward/UpwardPlanarSubgraphSimple.h>

Inheritance diagram for ogdf::UpwardPlanarSubgraphSimple:

Public Member Functions
	UpwardPlanarSubgraphSimple ()
	~UpwardPlanarSubgraphSimple ()
virtual void	call (const Graph &G, List< edge > &delEdges) override
	Computes set of edges delEdges which have to be deleted to obtain the upward planar subgraph. More...
void	call (GraphCopy &GC, List< edge > &delEdges)
Public Member Functions inherited from ogdf::UpwardPlanarSubgraphModule
	UpwardPlanarSubgraphModule ()
	Initializes an upward planar subgraph module. More...
virtual	~UpwardPlanarSubgraphModule ()
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...

Private Member Functions
bool	checkAcyclic (GraphCopySimple &graphAcyclicTest, SList< Tuple2< node, node >> &tmpAugmented)
void	dfsBuildSpanningTree (node v, SListPure< edge > &treeEdges, NodeArray< bool > &visited)

Detailed Description

A maximal planar subgraph algorithm using planarity testing.

Definition at line 52 of file UpwardPlanarSubgraphSimple.h.

Constructor & Destructor Documentation

UpwardPlanarSubgraphSimple()

ogdf::UpwardPlanarSubgraphSimple::UpwardPlanarSubgraphSimple ( )

inline

Definition at line 55 of file UpwardPlanarSubgraphSimple.h.

~UpwardPlanarSubgraphSimple()

ogdf::UpwardPlanarSubgraphSimple::~UpwardPlanarSubgraphSimple ( )

inline

Definition at line 58 of file UpwardPlanarSubgraphSimple.h.

Member Function Documentation

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()

bool ogdf::UpwardPlanarSubgraphSimple::checkAcyclic ( GraphCopySimple &  graphAcyclicTest, SList< Tuple2< node, node >> &  tmpAugmented  )

private

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:

• include/ogdf/upward/UpwardPlanarSubgraphSimple.h