SCIL::MIN_CUT< Graph > Class Template Reference
Class implements mincut algorithm of M.Stoer and F.Wagner.
#include <min_cut.h>
Collaboration diagram for SCIL::MIN_CUT< Graph >:
Public Member Functions | |
| MIN_CUT (const Graph &G_, const map< edge_descriptor, int > &w_) | |
| Constructor. | |
| void | run () |
| Function starts the algorithm by calling the required functions. | |
Public Attributes | |
| MC< Graph > | minCutOfPhase |
| MC< Graph > | minCut |
Detailed Description
template<typename Graph>
class SCIL::MIN_CUT< Graph >
Definition at line 50 of file min_cut.h.
The documentation for this class was generated from the following file:
