Declaration of interface for acyclic subgraph algorithms.
Declaration and implementation of NodeArray class.
Base class of algorithms for computing a maximal acyclic subgraph.
The parameterized class Array implements dynamic arrays of type E.
Data type for general directed graphs (adjacency list representation).
Greedy algorithm for computing a maximal acyclic subgraph.
NodeArray< bool > m_visited
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.
NodeArray< ListIterator< node > > m_item
void dfs(node v, const Graph &G)
Array< ListPure< node > > m_B
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.