DeSiGNAR  0.5a
Data Structures General Library
Public Member Functions | List of all members
Designar::KargerMinCut< GT > Class Template Reference

#include <graphalgorithms.H>

Public Member Functions

 KargerMinCut (rng_seed_t seed)
 
 KargerMinCut ()
 
std::tuple< SLList< Node< GT > * >, SLList< Node< GT > * >, SLList< Arc< GT > * > > compute_min_cut (const GT &g, nat_t num_it)
 
std::tuple< SLList< Node< GT > * >, SLList< Node< GT > * >, SLList< Arc< GT > * > > compute_min_cut (const GT &g)
 
std::tuple< SLList< Node< GT > * >, SLList< Node< GT > * >, SLList< Arc< GT > * > > compute_min_cut_fast (const GT &g)
 
std::tuple< SLList< Node< GT > * >, SLList< Node< GT > * >, SLList< Arc< GT > * > > operator() (const GT &g)
 

Constructor & Destructor Documentation

template<class GT >
Designar::KargerMinCut< GT >::KargerMinCut ( rng_seed_t  seed)
inline
template<class GT >
Designar::KargerMinCut< GT >::KargerMinCut ( )
inline

Member Function Documentation

template<class GT >
std::tuple<SLList<Node<GT> *>, SLList<Node<GT> *>, SLList<Arc<GT> *> > Designar::KargerMinCut< GT >::compute_min_cut ( const GT &  g,
nat_t  num_it 
)
inline
template<class GT >
std::tuple<SLList<Node<GT> *>, SLList<Node<GT> *>, SLList<Arc<GT> *> > Designar::KargerMinCut< GT >::compute_min_cut ( const GT &  g)
inline
template<class GT >
std::tuple<SLList<Node<GT> *>, SLList<Node<GT> *>, SLList<Arc<GT> *> > Designar::KargerMinCut< GT >::compute_min_cut_fast ( const GT &  g)
inline
template<class GT >
std::tuple<SLList<Node<GT> *>, SLList<Node<GT> *>, SLList<Arc<GT> *> > Designar::KargerMinCut< GT >::operator() ( const GT &  g)
inline

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