UpwardPlanarSubgraphSimple.h

Go to the documentation of this file.

/*
 * $Revision: 2299 $
 * 
 * last checkin:
 *   $Author: gutwenger $ 
 *   $Date: 2012-05-07 15:57:08 +0200 (Mon, 07 May 2012) $ 
 ***************************************************************/
 
#ifdef _MSC_VER
#pragma once
#endif


#ifndef OGDF_UPWARD_PLANAR_SUBGRAPH_SIMPLE_H
#define OGDF_UPWARD_PLANAR_SUBGRAPH_SIMPLE_H




#include <ogdf/module/UpwardPlanarSubgraphModule.h>
#include <ogdf/basic/tuples.h>


namespace ogdf {

//---------------------------------------------------------
// UpwardPlanarSubgraphSimple
// implements a maximal planar subgraph algorithm using
// planarity testing
//---------------------------------------------------------
class OGDF_EXPORT UpwardPlanarSubgraphSimple : public UpwardPlanarSubgraphModule
{
public:
    // construction
    UpwardPlanarSubgraphSimple() { }
    // destruction
    ~UpwardPlanarSubgraphSimple() { }

    // computes set of edges delEdges, which have to be deleted
    // in order to get a planar subgraph; edges in preferedEdges
    // should be contained in planar subgraph
    void call(const Graph &G, List<edge> &delEdges);

    void call(GraphCopy &GC, List<edge> &delEdges);


private:
    bool checkAcyclic(
        GraphCopySimple &graphAcyclicTest,
        SList<Tuple2<node,node> > &tmpAugmented);
    
    void dfsBuildSpanningTree(
        node v,
        SListPure<edge> &treeEdges,
        NodeArray<bool> &visited);

};


} // end namespace ogdf

#endif