Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

DfsAcyclicSubgraph.h
Go to the documentation of this file.
1 
32 #pragma once
33 
36 
37 namespace ogdf {
38 
40 
44 public:
46  virtual void call(const Graph& G, List<edge>& arcSet) override;
47 
49 
53  void callUML(const GraphAttributes& AG, List<edge>& arcSet);
54 
55 private:
56  int dfsFindHierarchies(const GraphAttributes& AG, NodeArray<int>& hierarchy, int i, node v);
57 
58  void dfsBackedgesHierarchies(const GraphAttributes& AG, node v, NodeArray<int>& number,
59  NodeArray<int>& completion, int& nNumber, int& nCompletion);
60 };
61 
62 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
ogdf::GraphAttributes
Stores additional attributes of a graph (like layout information).
Definition: GraphAttributes.h:66
GraphAttributes.h
Declaration of class GraphAttributes which extends a Graph by additional attributes.
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:651
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:862
ogdf::DfsAcyclicSubgraph
DFS-based algorithm for computing a maximal acyclic subgraph.
Definition: DfsAcyclicSubgraph.h:43
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:43
ogdf::NodeElement
Class for the representation of nodes.
Definition: Graph_d.h:233