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::DfsMakeBiconnected Class Reference

Implementation of a DFS-based algorithm for biconnectivity augmentation. More...

#include <ogdf/augmentation/DfsMakeBiconnected.h>

Inheritance diagram for ogdf::DfsMakeBiconnected:
ogdf::AugmentationModule

List of all members.

Public Member Functions

 DfsMakeBiconnected ()
 Creates an instance of DFS-based biconnectivity augmentation.
 ~DfsMakeBiconnected ()

Protected Member Functions

void doCall (Graph &G, List< edge > &L)
 Implements the algorithm call.

Detailed Description

Implementation of a DFS-based algorithm for biconnectivity augmentation.

The class DfsMakeBiconnected implements an augmentation algorithms that augments a graph to a biconnected graph. In addition, if the graph was planar before augmentation, the resulting graph will be biconnected and planar. The algorithm simply uses DFS and, whenever a cut vertex is discovered, a new edge is added.

Definition at line 75 of file DfsMakeBiconnected.h.

Constructor & Destructor Documentation

ogdf::DfsMakeBiconnected::DfsMakeBiconnected (  )  [inline]

Creates an instance of DFS-based biconnectivity augmentation.

Definition at line 65 of file DfsMakeBiconnected.h.

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

Definition at line 68 of file DfsMakeBiconnected.h.

Member Function Documentation

void ogdf::DfsMakeBiconnected::doCall ( Graph &  G,
List< edge > &  L 
) [protected, virtual]

Implements the algorithm call.

Implements ogdf::AugmentationModule.

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:11 by doxygen 1.7.1.