HLIBpro  2.2
Public Member Functions | Protected Member Functions | List of all members
TStdAlgAdmCond Class Reference

Standard admissibility condition based on matrix graph criteria. More...

#include <TAlgAdmCond.hh>

Inheritance diagram for TStdAlgAdmCond:
TAlgAdmCond TAdmCondition

Public Member Functions

 TStdAlgAdmCond (const real eta, const TSparseMatrix *S, const TPermutation *perm_i2e)
 ctor
 
 TStdAlgAdmCond (const real eta, const TSparseMatrix *S, const TPermutation *row_perm_i2e, const TPermutation *col_perm_i2e)
 ctor
 
virtual ~TStdAlgAdmCond ()
 dtor
 
virtual bool is_adm (const TBlockCluster *cl) const
 return true if cl is admissible
 
- Public Member Functions inherited from TAlgAdmCond
 TAlgAdmCond (const TSparseMatrix *S, const TPermutation *perm_e2i)
 
 TAlgAdmCond (const TSparseMatrix *S, const TPermutation *row_perm_e2i, const TPermutation *col_perm_e2i)
 
virtual ~TAlgAdmCond ()
 dtor
 
- Public Member Functions inherited from TAdmCondition
 TAdmCondition ()
 ctor
 
virtual ~TAdmCondition ()
 dtor
 

Protected Member Functions

virtual uint diameter (const TCluster *cl, const TPermutation *perm_i2e, const TPermutation *perm_e2i) const
 determine diameter of cluster cl
 
virtual uint bfs (TNodeSet &start, TNodeSet &last, const TCluster *tau, const TPermutation *perm_i2e, const TPermutation *perm_e2i) const
 
virtual bool cmp_dist (const TCluster *tau, const TCluster *sigma, const uint min_dist) const
 return true, if distance between tau and sigma is bigger than min_dist
 
bool is_local (const TCluster *cl, const node_t node, const TPermutation *perm_e2i) const
 return true if node is local to cluster tree cl
 

Detailed Description

Weak admissibility condition based on matrix graph criteria.

Member Function Documentation

virtual uint bfs ( TNodeSet start,
TNodeSet last,
const TCluster tau,
const TPermutation perm_i2e,
const TPermutation perm_e2i 
) const
protectedvirtual

Perform a BFS from set start in matrix and store last visited nodes in last. Stop BFS if all nodes in tau have been visited. Return the depth of the BFS iteration.