|
|||
|
|
|
|||
|
|
Base class of algorithms for computing a maximal acyclic subgraph. More...
#include <ogdf/module/AcyclicSubgraphModule.h>
Public Member Functions | |
| AcyclicSubgraphModule () | |
| Initializes an acyclic subgraph module. | |
| virtual | ~AcyclicSubgraphModule () |
| 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 | 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. | |
| void | callAndReverse (Graph &G, List< edge > &reversed) |
| Makes G acyclic by reversing edges. | |
| void | callAndReverse (Graph &G) |
| Makes G acyclic by reversing edges. | |
| void | callAndDelete (Graph &G) |
| Makes G acyclic by removing edges. | |
| void * | operator new (size_t nBytes) |
| void * | operator new (size_t, void *p) |
| void | operator delete (void *p, size_t nBytes) |
Base class of algorithms for computing a maximal acyclic subgraph.
Definition at line 70 of file AcyclicSubgraphModule.h.
| ogdf::AcyclicSubgraphModule::AcyclicSubgraphModule | ( | ) | [inline] |
Initializes an acyclic subgraph module.
Definition at line 73 of file AcyclicSubgraphModule.h.
| virtual ogdf::AcyclicSubgraphModule::~AcyclicSubgraphModule | ( | ) | [inline, virtual] |
Definition at line 76 of file AcyclicSubgraphModule.h.
| virtual void ogdf::AcyclicSubgraphModule::call | ( | const Graph & | G, | |
| List< edge > & | arcSet | |||
| ) | [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::DfsAcyclicSubgraph, and ogdf::GreedyCycleRemoval.
| void ogdf::AcyclicSubgraphModule::callAndDelete | ( | Graph & | G | ) |
Makes G acyclic by removing edges.
This method will also remove self-loops 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 self-loops in the input graph G; thus self-loops 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 self-loops in the input graph G; thus self-loops 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. |
| void ogdf::AcyclicSubgraphModule::operator delete | ( | void * | p, | |
| size_t | nBytes | |||
| ) | [inline] |
Definition at line 128 of file AcyclicSubgraphModule.h.
| void* ogdf::AcyclicSubgraphModule::operator new | ( | size_t | , | |
| void * | p | |||
| ) | [inline] |
Definition at line 128 of file AcyclicSubgraphModule.h.
| void* ogdf::AcyclicSubgraphModule::operator new | ( | size_t | nBytes | ) | [inline] |
Definition at line 128 of file AcyclicSubgraphModule.h.
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 94 of file AcyclicSubgraphModule.h.
