Includes declaration of graph class.
Base class of algorithms for computing a maximal acyclic subgraph.
void callAndReverse(Graph &G)
Makes G acyclic by reversing edges.
virtual ~AcyclicSubgraphModule()
Destruction.
AcyclicSubgraphModule()
Initializes an acyclic subgraph module.
void callAndReverse(Graph &G, List< edge > &reversed)
Makes G acyclic by reversing edges.
void operator()(const Graph &G, List< edge > &arcSet)
Computes the set of edges arcSet which have to be removed for obtaining an acyclic subgraph of G.
virtual void call(const Graph &G, List< edge > &arcSet)=0
Computes the set of edges arcSet which have to be removed for obtaining an acyclic subgraph of G.
void callAndDelete(Graph &G)
Makes G acyclic by removing edges.
Data type for general directed graphs (adjacency list representation).
Doubly linked lists (maintaining the length of the list).
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.