PlanarityChecking Class Template Reference
[Planarity embedding and drawing]

#include <lemon/planarity.h>

List of all members.


Detailed Description

template<typename UGraph>
class lemon::PlanarityChecking< UGraph >

This class implements the Boyer-Myrvold algorithm for planarity checking of an undirected graph. This class is a simplified version of the PlanarEmbedding algorithm class, and it does provide neither embedding nor kuratowski subdivisons.

Public Member Functions

 PlanarityChecking (const UGraph &ugraph)
 Constructor.
bool run ()
 Runs the algorithm.

Constructor & Destructor Documentation

PlanarityChecking ( const UGraph ugraph  )  [inline]

The graph should be simple, i.e. parallel and loop edge free.


Member Function Documentation

bool run (  )  [inline]

Runs the algorithm.

Returns:
True when the graph is planar.


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

Generated on Sat Apr 19 14:21:14 2008 for LEMON by  doxygen 1.5.5