ogdf::MinimumCutModule< T > Class Template Reference

Serves as an interface for various methods to compute minimum cuts with or without edge weights. More...

#include <ogdf/graphalg/MinimumCutModule.h>

Inheritance diagram for ogdf::MinimumCutModule< T >:

Public Member Functions
virtual	~MinimumCutModule ()
	Do nothing on destruction.
virtual T	call (const Graph &G)=0
	Computes the minimum cut of G.
virtual T	call (const Graph &G, const EdgeArray< T > &weights)=0
	Computes the minimum cut of G with edge weights weights.
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.
virtual T	value () const =0
	Returns the value of the last minimum cut computation.

Detailed Description

template<typename T>
class ogdf::MinimumCutModule< T >

Serves as an interface for various methods to compute minimum cuts with or without edge weights.

Template Parameters

T	The type of the edge weights of the mincut instance

Definition at line 47 of file MinimumCutModule.h.

Constructor & Destructor Documentation

~MinimumCutModule()

template<typename T >

virtual ogdf::MinimumCutModule< T >::~MinimumCutModule ( )

inlinevirtual

Do nothing on destruction.

Definition at line 50 of file MinimumCutModule.h.

Member Function Documentation

call() [1/2]

template<typename T >

virtual T ogdf::MinimumCutModule< T >::call ( const Graph &  G )

pure virtual

Computes the minimum cut of G.

Parameters

G	The input graph

Returns

The minimum cut value

Implemented in ogdf::MinimumCutNagamochiIbaraki, and ogdf::MinimumCutStoerWagner< T >.

call() [2/2]

template<typename T >

virtual T ogdf::MinimumCutModule< T >::call ( const Graph &  G, const EdgeArray< T > &  weights  )

pure virtual

Computes the minimum cut of G with edge weights weights.

Parameters

G	The input graph
weights	The edge weights

Returns

The minimum cut value

Implemented in ogdf::MinimumCutNagamochiIbaraki, and ogdf::MinimumCutStoerWagner< T >.

edges()

template<typename T >

virtual const ArrayBuffer< edge > & ogdf::MinimumCutModule< T >::edges ( )

pure virtual

Returns the edges defining the computed mincut.

Implemented in ogdf::MinimumCutNagamochiIbaraki, and ogdf::MinimumCutStoerWagner< T >.

nodes()

template<typename T >

virtual const ArrayBuffer< node > & ogdf::MinimumCutModule< T >::nodes ( )

pure virtual

Returns a list of nodes belonging to one side of the bipartition.

Implemented in ogdf::MinimumCutNagamochiIbaraki, and ogdf::MinimumCutStoerWagner< T >.

value()

template<typename T >

virtual T ogdf::MinimumCutModule< T >::value ( ) const

pure virtual

Returns the value of the last minimum cut computation.

Implemented in ogdf::MinimumCutNagamochiIbaraki, and ogdf::MinimumCutStoerWagner< T >.

---

The documentation for this class was generated from the following file:

• include/ogdf/graphalg/MinimumCutModule.h