Loading [MathJax]/extensions/tex2jax.js

Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
Loading...
Searching...
No Matches
AcyclicSubgraphModule.h
Go to the documentation of this file.
1
32#pragma once
33
34#include <ogdf/basic/Graph.h>
35
36namespace ogdf {
37
44public:
47
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
78
79 // makes G acyclic (except for self-loops!) by reversing edges
89
90 // makes G acyclic by deleting edges
98
100};
101
102}
Includes declaration of graph class.
Base class of algorithms for computing a maximal acyclic subgraph.
void callAndReverse(Graph &G)
Makes G acyclic by reversing edges.
virtual ~AcyclicSubgraphModule()
Destruction.
AcyclicSubgraphModule()
Initializes an acyclic subgraph module.
void callAndReverse(Graph &G, List< edge > &reversed)
Makes G acyclic by reversing edges.
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.
virtual void call(const Graph &G, List< edge > &arcSet)=0
Computes the set of edges arcSet which have to be removed for obtaining an acyclic subgraph of G.
void callAndDelete(Graph &G)
Makes G acyclic by removing edges.
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521
Doubly linked lists (maintaining the length of the list).
Definition List.h:1435
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition config.h:101
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Definition memory.h:91
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.