Minstcut algorithm, that calculates the cut by doing a depth first search over the dual graph of of an stplanar input graph.
More...
#include <ogdf/graphalg/MinSTCutBFS.h>
template<typename TCost>
class ogdf::MinSTCutBFS< TCost >
Minstcut algorithm, that calculates the cut by doing a depth first search over the dual graph of of an stplanar input graph.
 Precondition
 The input graph is stplanar.
 Template Parameters

TCost  The type in which the weight of the edges is given. 
Definition at line 59 of file MinSTCutBFS.h.
◆ MinSTCutBFS()
template<typename TCost >
◆ call() [1/3]
template<typename TCost >
The actual algorithm call.
 Parameters

graph  The graph on which the minstcut is to be calculated. 
weight  Provides a weight for every edge. 
s  The source node. 
t  The target node. 
edgeList  This list is filled with the edges which are part of the mincut. If the graph is stplanarly embedded, this list is correctly ordered along the cut. 
e_st  An edge between s and t which is used to determine where the cut should start, nullptr elsewise. 
 Returns
 Indicates success.
Implements ogdf::MinSTCutModule< TCost >.
Definition at line 74 of file MinSTCutBFS.h.
◆ call() [2/3]
template<typename TCost >
This internal call uses a pointer to the weight
instead of a reference.
The actual algorithm call.
 Parameters

graph  The graph on which the minstcut is to be calculated. 
weight  Provides a weight for every edge. 
s  The source node. 
t  The target node. 
edgeList  This list is filled with the edges which are part of the mincut. If the graph is stplanarly embedded, this list is correctly ordered along the cut. 
e_st  An edge between s and t which is used to determine where the cut should start, nullptr elsewise. 
 Returns
 Indicates success.
Definition at line 92 of file MinSTCutBFS.h.
◆ call() [3/3]
template<typename TCost >
The actual algorithm call.
 Parameters

graph  The graph on which the minstcut is to be calculated. 
s  The source node. 
t  The target node. 
edgeList  This list is filled with the edges which are part of the mincut. If the graph is stplanarly embedded, this list is correctly ordered along the cut. 
e_st  An edge between s and t which is used to determine where the cut should start, nullptr elsewise. 
 Returns
 Indicates success.
Implements ogdf::MinSTCutModule< TCost >.
Definition at line 66 of file MinSTCutBFS.h.
The documentation for this class was generated from the following file: