Declaration of interface for acyclic subgraph algorithms.
Declaration and implementation of Array class and Array algorithms.
Includes declaration of graph class.
Declaration of doubly linked lists and iterators.
Basic declarations, included by all source files.
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).
Class for the representation of nodes.
RegisteredArray for nodes, edges and adjEntries of a graph.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
The namespace for all OGDF objects.