Computes a minimum cut in a graph.
More...
#include <ogdf/graphalg/MinimumCut.h>
Computes a minimum cut in a graph.
Definition at line 49 of file MinimumCut.h.
◆ MinCut()
◆ ~MinCut()
ogdf::MinCut::~MinCut |
( |
| ) |
|
◆ contraction()
void ogdf::MinCut::contraction |
( |
node |
t, |
|
|
node |
s |
|
) |
| |
|
private |
◆ cutEdges()
◆ minCutValue()
double ogdf::MinCut::minCutValue |
( |
| ) |
const |
|
inline |
◆ minimumCut()
double ogdf::MinCut::minimumCut |
( |
| ) |
|
◆ minimumCutPhase()
double ogdf::MinCut::minimumCutPhase |
( |
| ) |
|
|
private |
◆ partition()
void ogdf::MinCut::partition |
( |
List< node > & |
nodes | ) |
|
◆ m_contractedNodes
◆ m_contraction1
◆ m_contraction2
◆ m_cutEdges
◆ m_GC
◆ m_minCut
double ogdf::MinCut::m_minCut |
|
private |
◆ m_partition
◆ m_w
The documentation for this class was generated from the following file: