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).
Doubly linked lists (maintaining the length of the list).
Dynamic arrays indexed with nodes.
Class for the representation of nodes.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.