Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

MinimumCutModule.h
Go to the documentation of this file.
1 
32 #pragma once
33 
34 #include <ogdf/basic/Graph_d.h>
35 
36 namespace ogdf {
37 
44 template<typename T>
46 public:
48  virtual ~MinimumCutModule() { }
49 
56  virtual T call(const Graph& G) = 0;
57 
65  virtual T call(const Graph& G, const EdgeArray<T>& weights) = 0;
66 
68  virtual const ArrayBuffer<edge>& edges() = 0;
69 
71  virtual const ArrayBuffer<node>& nodes() = 0;
72 
74  virtual T value() const = 0;
75 };
76 
77 }
ogdf::ArrayBuffer< edge >
ogdf::MinimumCutModule::~MinimumCutModule
virtual ~MinimumCutModule()
Do nothing on destruction.
Definition: MinimumCutModule.h:48
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
ogdf::MinimumCutModule
Serves as an interface for various methods to compute minimum cuts with or without edge weights.
Definition: MinimumCutModule.h:45
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:862
ogdf::MinimumCutModule::value
virtual T value() const =0
Returns the value of the last minimum cut computation.
ogdf::MinimumCutModule::call
virtual T call(const Graph &G)=0
Computes the minimum cut of G.
Graph_d.h
Pure declaration header, find template implementation in Graph.h.
ogdf::MinimumCutModule::edges
virtual const ArrayBuffer< edge > & edges()=0
Returns the edges defining the computed mincut.
ogdf::MinimumCutModule::nodes
virtual const ArrayBuffer< node > & nodes()=0
Returns a list of nodes belonging to one side of the bipartition.
ogdf::internal::EdgeArrayBase2
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
Definition: Graph_d.h:709