Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
DfsAcyclicSubgraph.h
Go to the documentation of this file.
1
32#pragma once
33
36
37namespace ogdf {
38
40
44public:
46 virtual void call(const Graph& G, List<edge>& arcSet) override;
47
49
54
55private:
56 int dfsFindHierarchies(const GraphAttributes& AG, NodeArray<int>& hierarchy, int i, node v);
57
60};
61
62}
Declaration of interface for acyclic subgraph algorithms.
Declaration of class GraphAttributes which extends a Graph by additional attributes.
Base class of algorithms for computing a maximal acyclic subgraph.
DFS-based algorithm for computing a maximal acyclic subgraph.
void callUML(const GraphAttributes &AG, List< edge > &arcSet)
Call for UML graph.
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.
void dfsBackedgesHierarchies(const GraphAttributes &AG, node v, NodeArray< int > &number, NodeArray< int > &completion, int &nNumber, int &nCompletion)
int dfsFindHierarchies(const GraphAttributes &AG, NodeArray< int > &hierarchy, int i, node v)
Stores additional attributes of a graph (like layout information).
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
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.