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
34#include <ogdf/basic/Graph.h>
35#include <ogdf/basic/basic.h>
37
38namespace ogdf {
39class GraphAttributes;
40template<class E>
41class List;
42
44
48public:
50 virtual void call(const Graph& G, List<edge>& arcSet) override;
51
53
57 void callUML(const GraphAttributes& AG, List<edge>& arcSet);
58
59private:
60 int dfsFindHierarchies(const GraphAttributes& AG, NodeArray<int>& hierarchy, int i, node v);
61
63 NodeArray<int>& completion, int& nNumber, int& nCompletion);
64};
65
66}
Declaration of interface for acyclic subgraph algorithms.
Includes declaration of graph class.
Basic declarations, included by all source files.
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:866
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.