80 m_nAddedEdges = L.
size();
Includes declaration of graph class.
Declaration of doubly linked lists and iterators.
Basic declarations, included by all source files.
The base class for graph augmentation algorithms.
void operator()(Graph &G, List< edge > &L)
Calls the augmentation module for graph G.
int numberOfAddedEdges() const
Returns the number of added edges.
virtual ~AugmentationModule()
void call(Graph &G, List< edge > &L)
Calls the augmentation module for graph G.
void operator()(Graph &G)
Calls the augmentation module for graph G.
virtual void doCall(Graph &G, List< edge > &L)=0
Implements the augmentation algorithm for graph G.
AugmentationModule()
Initializes an augmentation module.
void call(Graph &G)
Calls the augmentation module for graph G.
Data type for general directed graphs (adjacency list representation).
Doubly linked lists (maintaining the length of the list).
int size() const
Returns the number of elements in the list.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Declaration of memory manager for allocating small pieces of memory.
The namespace for all OGDF objects.