Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
DfsMakeBiconnected.h
Go to the documentation of this file.
1
32#pragma once
33
34#include <ogdf/basic/Graph.h>
35#include <ogdf/basic/basic.h>
37
38namespace ogdf {
39template<class E>
40class List;
41
56public:
59
62
63protected:
65 virtual void doCall(Graph& G, List<edge>& L) override;
66};
67
68}
Declaration of interface for graph augmentation algorithms.
Includes declaration of graph class.
Basic declarations, included by all source files.
The base class for graph augmentation algorithms.
Implementation of a DFS-based algorithm for biconnectivity augmentation.
DfsMakeBiconnected()
Creates an instance of DFS-based biconnectivity augmentation.
virtual void doCall(Graph &G, List< edge > &L) override
Implements the algorithm call.
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:866
Doubly linked lists (maintaining the length of the list).
Definition List.h:1451
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
Definition config.h:117
The namespace for all OGDF objects.