Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

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(
57  const GraphAttributes &AG,
58  NodeArray<int> &hierarchy,
59  int i,
60  node v);
61 
62  void dfsBackedgesHierarchies(
63  const GraphAttributes &AG,
64  node v,
65  NodeArray<int> &number,
66  NodeArray<int> &completion,
67  int &nNumber,
68  int &nCompletion);
69 
70 };
71 
72 }
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:67
GraphAttributes.h
Declaration of class GraphAttributes which extends a Graph by additional attributes.
ogdf::NodeArray< int >
AcyclicSubgraphModule.h
Declaration of interface for acyclic subgraph algorithms.
ogdf::List< edge >
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:495
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:99
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:169