Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

AcyclicSubgraphModule.h
Go to the documentation of this file.
1 
32 #pragma once
33 
34 #include <ogdf/basic/Graph.h>
35 
36 namespace ogdf {
37 
44 public:
47 
49  virtual ~AcyclicSubgraphModule() { }
50 
59  virtual void call(const Graph& G, List<edge>& arcSet) = 0;
60 
67  void operator()(const Graph& G, List<edge>& arcSet) { call(G, arcSet); }
68 
77  void callAndReverse(Graph& G, List<edge>& reversed);
78 
79  // makes G acyclic (except for self-loops!) by reversing edges
88  void callAndReverse(Graph& G);
89 
90  // makes G acyclic by deleting edges
97  void callAndDelete(Graph& G);
98 
100 };
101 
102 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
Graph.h
Includes declaration of graph class.
OGDF_MALLOC_NEW_DELETE
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Definition: memory.h:91
ogdf::List< edge >
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:862
ogdf::AcyclicSubgraphModule::AcyclicSubgraphModule
AcyclicSubgraphModule()
Initializes an acyclic subgraph module.
Definition: AcyclicSubgraphModule.h:46
OGDF_EXPORT
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition: config.h:101
ogdf::AcyclicSubgraphModule
Base class of algorithms for computing a maximal acyclic subgraph.
Definition: AcyclicSubgraphModule.h:43
ogdf::AcyclicSubgraphModule::operator()
void operator()(const Graph &G, List< edge > &arcSet)
Computes the set of edges arcSet which have to be removed for obtaining an acyclic subgraph of G.
Definition: AcyclicSubgraphModule.h:67
ogdf::AcyclicSubgraphModule::~AcyclicSubgraphModule
virtual ~AcyclicSubgraphModule()
Destruction.
Definition: AcyclicSubgraphModule.h:49