|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
37 template<
class E,
class INDEX>
76 virtual T
value()
const = 0;
virtual ~MinimumCutModule()
Do nothing on destruction.
The namespace for all OGDF objects.
Includes declaration of graph class.
Serves as an interface for various methods to compute minimum cuts with or without edge weights.
Data type for general directed graphs (adjacency list representation).
virtual T value() const =0
Returns the value of the last minimum cut computation.
virtual T call(const Graph &G)=0
Computes the minimum cut of G.
virtual const ArrayBuffer< edge > & edges()=0
Returns the edges defining the computed mincut.
virtual const ArrayBuffer< node > & nodes()=0
Returns a list of nodes belonging to one side of the bipartition.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.