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
34#include <ogdf/basic/Array.h>
35#include <ogdf/basic/Graph.h>
36#include <ogdf/basic/List.h>
37#include <ogdf/basic/basic.h>
39
40namespace ogdf {
41
43
48public:
50
52 virtual void call(const Graph& G, List<edge>& arcSet) override;
53
54private:
55 void dfs(node v, const Graph& G);
56
57 int m_min, m_max, m_counter;
58
59 NodeArray<int> m_in, m_out, m_index;
63};
64
65}
Declaration of interface for acyclic subgraph algorithms.
Declaration and implementation of Array class and Array algorithms.
Includes declaration of graph class.
Declaration of doubly linked lists and iterators.
Basic declarations, included by all source files.
Base class of algorithms for computing a maximal acyclic subgraph.
The parameterized class Array implements dynamic arrays of type E.
Definition Array.h:219
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:866
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:1451
Class for the representation of nodes.
Definition Graph_d.h:241
RegisteredArray for nodes, edges and adjEntries of a graph.
Definition Graph_d.h:659
#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.