Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::Compute_Min_Cut< GT, Max_Flow, SA > Class Template Reference

Functor wrapper for compute_min_cut(). More...

#include <tpl_kgraph.H>

Public Member Functions

long operator() (GT &g, DynSetTree< typename GT::Node * > &l, DynSetTree< typename GT::Node * > &r, DynDlist< typename GT::Arc * > &cut)
 Compute a minimum edge cut for g.
 

Detailed Description

template<class GT, template< class > class Max_Flow = Heap_Preflow_Maximum_Flow, class SA = Dft_Show_Arc<GT>>
class Aleph::Compute_Min_Cut< GT, Max_Flow, SA >

Functor wrapper for compute_min_cut().

Template Parameters
GTGraph type (undirected).
Max_FlowMaximum flow functor.
SAArc filter functor.

Definition at line 454 of file tpl_kgraph.H.

Member Function Documentation

◆ operator()()

template<class GT , template< class > class Max_Flow = Heap_Preflow_Maximum_Flow, class SA = Dft_Show_Arc<GT>>
long Aleph::Compute_Min_Cut< GT, Max_Flow, SA >::operator() ( GT g,
DynSetTree< typename GT::Node * > &  l,
DynSetTree< typename GT::Node * > &  r,
DynDlist< typename GT::Arc * > &  cut 
)
inline

Compute a minimum edge cut for g.

Definition at line 458 of file tpl_kgraph.H.

References l, and Aleph::maps().


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