Serves as an interface for various methods to compute minimum cuts with or without edge weights. More...
#include <ogdf/graphalg/MinimumCutModule.h>
Public Member Functions | |
virtual | ~MinimumCutModule () |
Do nothing on destruction. More... | |
virtual T | call (const Graph &G)=0 |
Computes the minimum cut of G . More... | |
virtual T | call (const Graph &G, const EdgeArray< T > &weights)=0 |
Computes the minimum cut of G with edge weights weights . More... | |
virtual const ArrayBuffer< edge > & | edges ()=0 |
Returns the edges defining the computed mincut. More... | |
virtual const ArrayBuffer< node > & | nodes ()=0 |
Returns a list of nodes belonging to one side of the bipartition. More... | |
virtual T | value () const =0 |
Returns the value of the last minimum cut computation. More... | |
Serves as an interface for various methods to compute minimum cuts with or without edge weights.
T | The type of the edge weights of the mincut instance |
Definition at line 47 of file MinimumCutModule.h.
|
inlinevirtual |
Do nothing on destruction.
Definition at line 50 of file MinimumCutModule.h.
|
pure virtual |
Computes the minimum cut of G
.
G | The input graph |
Implemented in ogdf::MinimumCutNagamochiIbaraki, and ogdf::MinimumCutStoerWagner< T >.
|
pure virtual |
Computes the minimum cut of G
with edge weights weights
.
G | The input graph |
weights | The edge weights |
Implemented in ogdf::MinimumCutNagamochiIbaraki.
|
pure virtual |
Returns the edges defining the computed mincut.
Implemented in ogdf::MinimumCutNagamochiIbaraki, and ogdf::MinimumCutStoerWagner< T >.
|
pure virtual |
Returns a list of nodes belonging to one side of the bipartition.
Implemented in ogdf::MinimumCutStoerWagner< T >, and ogdf::MinimumCutNagamochiIbaraki.
|
pure virtual |
Returns the value of the last minimum cut computation.