Open
Graph Drawing
Framework

  v.2010.10
 
Overview Class Hierarchy Class Index Class List Members Namespaces Source Files

Public Member Functions | Protected Member Functions

ogdf::PlanarSubgraphModule Class Reference

Interface for planar subgraph algorithms. More...

#include <ogdf/module/PlanarSubgraphModule.h>

Inheritance diagram for ogdf::PlanarSubgraphModule:
ogdf::Module ogdf::Timeouter ogdf::FastPlanarSubgraph ogdf::MaximalPlanarSubgraphSimple ogdf::MaximumPlanarSubgraph

List of all members.

Public Member Functions

 PlanarSubgraphModule ()
 Initializes a planar subgraph module.
virtual ~PlanarSubgraphModule ()
ReturnType call (const Graph &G, const List< edge > &preferedEdges, List< edge > &delEdges, bool preferedImplyPlanar=false)
 Returns the set of edges delEdges which have to be deleted to obtain the planar subgraph.
ReturnType call (const Graph &G, const EdgeArray< int > &cost, List< edge > &delEdges)
 Returns the set of edges delEdges which have to be deleted to obtain the planar subgraph.
ReturnType call (const Graph &G, List< edge > &delEdges)
 Returns the set of edges delEdges which have to be deleted to obtain the planar subgraph.
ReturnType operator() (const Graph &G, const List< edge > &preferedEdges, List< edge > &delEdges, bool preferedImplyPlanar=false)
 Returns the set of edges delEdges which have to be deleted to obtain the planar subgraph.
ReturnType operator() (const Graph &G, List< edge > &delEdges)
 Returns the set of edges delEdges which have to be deleted to obtain the planar subgraph.
ReturnType callAndDelete (GraphCopy &GC, const List< edge > &preferedEdges, List< edge > &delOrigEdges, bool preferedImplyPlanar=false)
 Makes G planar by deleting edges.
ReturnType callAndDelete (GraphCopy &GC, List< edge > &delOrigEdges)
 Makes G planar by deleting edges.
void * operator new (size_t nBytes)
void * operator new (size_t, void *p)
void operator delete (void *p, size_t nBytes)

Protected Member Functions

virtual ReturnType doCall (const Graph &G, const List< edge > &preferedEdges, List< edge > &delEdges, const EdgeArray< int > *pCost=0, bool preferedImplyPlanar=false)=0
 Computes the set of edges delEdges which have to be deleted to obtain the planar subgraph.

Detailed Description

Interface for planar subgraph algorithms.

See also:
PlanarizationLayout, PlanarizationGridLayout

Definition at line 75 of file PlanarSubgraphModule.h.

Constructor & Destructor Documentation

ogdf::PlanarSubgraphModule::PlanarSubgraphModule (  )  [inline]

Initializes a planar subgraph module.

Definition at line 78 of file PlanarSubgraphModule.h.

virtual ogdf::PlanarSubgraphModule::~PlanarSubgraphModule (  )  [inline, virtual]

Definition at line 81 of file PlanarSubgraphModule.h.

Member Function Documentation

ReturnType ogdf::PlanarSubgraphModule::call ( const Graph &  G,
const List< edge > &  preferedEdges,
List< edge > &  delEdges,
bool  preferedImplyPlanar = false 
) [inline]

Returns the set of edges delEdges which have to be deleted to obtain the planar subgraph.

Parameters:
G is the input graph.
preferedEdges are edges that should be contained in the planar subgraph.
delEdges is the set of edges that need to be deleted to obtain the planar subgraph.
preferedImplyPlanar indicates that the edges preferedEdges induce a planar graph.

Definition at line 90 of file PlanarSubgraphModule.h.

ReturnType ogdf::PlanarSubgraphModule::call ( const Graph &  G,
const EdgeArray< int > &  cost,
List< edge > &  delEdges 
) [inline]

Returns the set of edges delEdges which have to be deleted to obtain the planar subgraph.

Parameters:
G is the input graph.
cost are the costs of edges.
delEdges is the set of edges that need to be deleted to obtain the planar subgraph.

Definition at line 105 of file PlanarSubgraphModule.h.

ReturnType ogdf::PlanarSubgraphModule::call ( const Graph &  G,
List< edge > &  delEdges 
) [inline]

Returns the set of edges delEdges which have to be deleted to obtain the planar subgraph.

Parameters:
G is the input graph.
delEdges is the set of edges that need to be deleted to obtain the planar subgraph.

Definition at line 115 of file PlanarSubgraphModule.h.

ReturnType ogdf::PlanarSubgraphModule::callAndDelete ( GraphCopy &  GC,
const List< edge > &  preferedEdges,
List< edge > &  delOrigEdges,
bool  preferedImplyPlanar = false 
)

Makes G planar by deleting edges.

Parameters:
GC is a copy of the input graph.
preferedEdges are edges in GC that should be contained in the planar subgraph.
delOrigEdges is the set of original edges whose copy has been deleted in GC.
preferedImplyPlanar indicates that the edges preferedEdges induce a planar graph.
ReturnType ogdf::PlanarSubgraphModule::callAndDelete ( GraphCopy &  GC,
List< edge > &  delOrigEdges 
) [inline]

Makes G planar by deleting edges.

Parameters:
GC is a copy of the input graph.
delOrigEdges is the set of original edges whose copy has been deleted in GC.

Definition at line 153 of file PlanarSubgraphModule.h.

virtual ReturnType ogdf::PlanarSubgraphModule::doCall ( const Graph &  G,
const List< edge > &  preferedEdges,
List< edge > &  delEdges,
const EdgeArray< int > *  pCost = 0,
bool  preferedImplyPlanar = false 
) [protected, pure virtual]

Computes the set of edges delEdges which have to be deleted to obtain the planar subgraph.

This is the actual algorithm call and needs to be implemented by derived classes.

Parameters:
G is the input graph.
preferedEdges are edges that should be contained in the planar subgraph.
delEdges is the set of edges that need to be deleted to obtain the planar subgraph.
pCost is apointer to an edge array containing the edge costs; this pointer can be 0 if no costs are given (all edges have cost 1).
preferedImplyPlanar indicates that the edges preferedEdges induce a planar graph.

Implemented in ogdf::FastPlanarSubgraph, ogdf::MaximalPlanarSubgraphSimple, and ogdf::MaximumPlanarSubgraph.

void ogdf::PlanarSubgraphModule::operator delete ( void *  p,
size_t  nBytes 
) [inline]

Definition at line 183 of file PlanarSubgraphModule.h.

void* ogdf::PlanarSubgraphModule::operator new ( size_t  ,
void *  p 
) [inline]

Definition at line 183 of file PlanarSubgraphModule.h.

void* ogdf::PlanarSubgraphModule::operator new ( size_t  nBytes  )  [inline]

Definition at line 183 of file PlanarSubgraphModule.h.

ReturnType ogdf::PlanarSubgraphModule::operator() ( const Graph &  G,
List< edge > &  delEdges 
) [inline]

Returns the set of edges delEdges which have to be deleted to obtain the planar subgraph.

Definition at line 131 of file PlanarSubgraphModule.h.

ReturnType ogdf::PlanarSubgraphModule::operator() ( const Graph &  G,
const List< edge > &  preferedEdges,
List< edge > &  delEdges,
bool  preferedImplyPlanar = false 
) [inline]

Returns the set of edges delEdges which have to be deleted to obtain the planar subgraph.

Definition at line 122 of file PlanarSubgraphModule.h.

The documentation for this class was generated from the following file:
© 1999-2010 by oreas GmbH, © 2005-2010 by Technische Universität Dortmund, University of Jena and University of Cologne.

Generated on Wed Oct 20 2010 11:14:22 by doxygen 1.7.1.