|
|||
|
|
|
|||
|
|
Implementation of a DFS-based algorithm for biconnectivity augmentation. More...
#include <ogdf/augmentation/DfsMakeBiconnected.h>
Inheritance diagram for ogdf::DfsMakeBiconnected:Public Member Functions | |
| DfsMakeBiconnected () | |
| Creates an instance of DFS-based biconnectivity augmentation. | |
| ~DfsMakeBiconnected () | |
| Destruction. | |
| Public Member Functions inherited from ogdf::AugmentationModule | |
| AugmentationModule () | |
| Initializes an augmentation module. | |
| virtual | ~AugmentationModule () |
| void | call (Graph &G) |
Calls the augmentation module for graph G. | |
| void | call (Graph &G, List< edge > &L) |
Calls the augmentation module for graph G. | |
| int | numberOfAddedEdges () const |
| Returns the number of added edges. | |
| void | operator() (Graph &G) |
Calls the augmentation module for graph G. | |
| void | operator() (Graph &G, List< edge > &L) |
Calls the augmentation module for graph G. | |
Protected Member Functions | |
| virtual void | doCall (Graph &G, List< edge > &L) override |
| Implements the algorithm call. | |
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 51 of file DfsMakeBiconnected.h.
|
inline |
Creates an instance of DFS-based biconnectivity augmentation.
Definition at line 54 of file DfsMakeBiconnected.h.
|
inline |
Destruction.
Definition at line 57 of file DfsMakeBiconnected.h.
|
overrideprotectedvirtual |
Implements the algorithm call.
Implements ogdf::AugmentationModule.
