Inheritance diagram for ogdf::UpwardPlanarSubgraphSimple:

Public Member Functions
	UpwardPlanarSubgraphSimple ()
	~UpwardPlanarSubgraphSimple ()
void	call (const Graph &G, List< edge > &delEdges)
	Computes set of edges delEdges which have to be deleted to obtain the upward planar subgraph.
void	call (GraphCopy &GC, List< edge > &delEdges)
Private Member Functions
bool	checkAcyclic (GraphCopySimple &graphAcyclicTest, SList< Tuple2< node, node > > &tmpAugmented)
void	dfsBuildSpanningTree (node v, SListPure< edge > &treeEdges, NodeArray< bool > &visited)

Detailed Description

Constructor & Destructor Documentation

ogdf::UpwardPlanarSubgraphSimple::UpwardPlanarSubgraphSimple ( ) [inline]

ogdf::UpwardPlanarSubgraphSimple::~UpwardPlanarSubgraphSimple ( ) [inline]

void ogdf::UpwardPlanarSubgraphSimple::call	(	const Graph &	G,
		List< edge > &	delEdges
	)		`[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.

void ogdf::UpwardPlanarSubgraphSimple::call	(	GraphCopy &	GC,
		List< edge > &	delEdges
	)

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

void ogdf::UpwardPlanarSubgraphSimple::dfsBuildSpanningTree	(	node	v,
		SListPure< edge > &	treeEdges,
		NodeArray< bool > &	visited
	)		`[private]`

The documentation for this class was generated from the following file: