Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
MinimumCutModule.h
Go to the documentation of this file.
1
32#pragma once
33
34#include <ogdf/basic/Graph.h>
35
36namespace ogdf {
37template<class E, class INDEX>
38class ArrayBuffer;
39
46template<typename T>
48public:
50 virtual ~MinimumCutModule() { }
51
58 virtual T call(const Graph& G) = 0;
59
67 virtual T call(const Graph& G, const EdgeArray<T>& weights) = 0;
68
70 virtual const ArrayBuffer<edge>& edges() = 0;
71
73 virtual const ArrayBuffer<node>& nodes() = 0;
74
76 virtual T value() const = 0;
77};
78
79}
Includes declaration of graph class.
An array that keeps track of the number of inserted elements; also usable as an efficient stack.
Definition ArrayBuffer.h:64
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:866
Serves as an interface for various methods to compute minimum cuts with or without edge weights.
virtual T value() const =0
Returns the value of the last minimum cut computation.
virtual T call(const Graph &G, const EdgeArray< T > &weights)=0
Computes the minimum cut of G with edge weights weights.
virtual const ArrayBuffer< node > & nodes()=0
Returns a list of nodes belonging to one side of the bipartition.
virtual const ArrayBuffer< edge > & edges()=0
Returns the edges defining the computed mincut.
virtual ~MinimumCutModule()
Do nothing on destruction.
virtual T call(const Graph &G)=0
Computes the minimum cut of G.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
Definition Graph_d.h:717
The namespace for all OGDF objects.