Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

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 
38 namespace ogdf {
39 class GraphAttributes;
40 template<class E>
41 class List;
42 
44 
48 public:
50  virtual void call(const Graph& G, List<edge>& arcSet) override;
51 
53 
57  void callUML(const GraphAttributes& AG, List<edge>& arcSet);
58 
59 private:
60  int dfsFindHierarchies(const GraphAttributes& AG, NodeArray<int>& hierarchy, int i, node v);
61 
62  void dfsBackedgesHierarchies(const GraphAttributes& AG, node v, NodeArray<int>& number,
63  NodeArray<int>& completion, int& nNumber, int& nCompletion);
64 };
65 
66 }
ogdf
The namespace for all OGDF objects.
Definition: multilevelmixer.cpp:39
ogdf::GraphAttributes
Stores additional attributes of a graph (like layout information).
Definition: GraphAttributes.h:72
Graph.h
Includes declaration of graph class.
AcyclicSubgraphModule.h
Declaration of interface for acyclic subgraph algorithms.
ogdf::List< edge >
ogdf::internal::GraphRegisteredArray
RegisteredArray for nodes, edges and adjEntries of a graph.
Definition: Graph_d.h:658
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:869
ogdf::DfsAcyclicSubgraph
DFS-based algorithm for computing a maximal acyclic subgraph.
Definition: DfsAcyclicSubgraph.h:47
basic.h
Basic declarations, included by all source files.
OGDF_EXPORT
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition: config.h:101
ogdf::AcyclicSubgraphModule
Base class of algorithms for computing a maximal acyclic subgraph.
Definition: AcyclicSubgraphModule.h:47
ogdf::NodeElement
Class for the representation of nodes.
Definition: Graph_d.h:240