Base class of algorithms for computing a maximal acyclic subgraph. More...
#include <ogdf/layered/AcyclicSubgraphModule.h>
Public Member Functions  
AcyclicSubgraphModule ()  
Initializes an acyclic subgraph module. More...  
virtual  ~AcyclicSubgraphModule () 
Destruction. More...  
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 . More...  
void  callAndDelete (Graph &G) 
Makes G acyclic by removing edges. More...  
void  callAndReverse (Graph &G) 
Makes G acyclic by reversing edges. More...  
void  callAndReverse (Graph &G, List< edge > &reversed) 
Makes G acyclic by reversing edges. More...  
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 . More...  
Base class of algorithms for computing a maximal acyclic subgraph.
Definition at line 43 of file AcyclicSubgraphModule.h.

inline 
Initializes an acyclic subgraph module.
Definition at line 46 of file AcyclicSubgraphModule.h.

inlinevirtual 
Destruction.
Definition at line 49 of file AcyclicSubgraphModule.h.

pure virtual 
Computes the set of edges arcSet
which have to be removed for obtaining an acyclic subgraph of G
.
This is the actual algorithm call and must be implemented by derived classes.
G  is the input graph. 
arcSet  is assigned the list of edges that have to be removed in G . 
Implemented in ogdf::GreedyCycleRemoval, and ogdf::DfsAcyclicSubgraph.
void ogdf::AcyclicSubgraphModule::callAndDelete  (  Graph &  G  ) 
Makes G
acyclic by removing edges.
This method will also remove selfloops in the input graph G
.
G  is the input graph. 
void ogdf::AcyclicSubgraphModule::callAndReverse  (  Graph &  G  ) 
Makes G
acyclic by reversing edges.
This method will ignore selfloops in the input graph G
; thus selfloops are neither reversed nor removed. This is the simplified version of callAndDelete() that does not return the list of reversed edges.
G  is the input graph. 
Makes G
acyclic by reversing edges.
This method will ignore selfloops in the input graph G
; thus selfloops are neither reversed or removed nor added to reversed
.
G  is the input graph. 
reversed  is assigned the list of edges that have been reversed in G . 
Computes the set of edges arcSet
which have to be removed for obtaining an acyclic subgraph of G
.
G  is the input graph. 
arcSet  is assigned the list of edges that have to be removed in G . 
Definition at line 67 of file AcyclicSubgraphModule.h.