Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
GreedyCycleRemoval.h
Go to the documentation of this file.
1
32#pragma once
33
36
37namespace ogdf {
38
40
45public:
47
49 virtual void call(const Graph& G, List<edge>& arcSet) override;
50
51private:
52 void dfs(node v, const Graph& G);
53
54 int m_min, m_max, m_counter;
55
56 NodeArray<int> m_in, m_out, m_index;
60};
61
62}
Declaration of interface for acyclic subgraph algorithms.
Declaration and implementation of NodeArray class.
Base class of algorithms for computing a maximal acyclic subgraph.
The parameterized class Array implements dynamic arrays of type E.
Definition Array.h:214
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521
Greedy algorithm for computing a maximal acyclic subgraph.
virtual void call(const Graph &G, List< edge > &arcSet) override
Computes the set of edges arcSet, which have to be deleted in the acyclic subgraph.
NodeArray< ListIterator< node > > m_item
void dfs(node v, const Graph &G)
Array< ListPure< node > > m_B
Doubly linked lists (maintaining the length of the list).
Definition List.h:1435
Dynamic arrays indexed with nodes.
Definition NodeArray.h:125
Class for the representation of nodes.
Definition Graph_d.h:177
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition config.h:101
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.