Biconnected componetns Depth-First-Search visitor class. 
Definition at line 195 of file cncom.h.
 
  
  
      
        
          | void TBiConVisitor::FinishNode  | 
          ( | 
          const int &  | 
          NId | ) | 
           | 
         
       
   | 
  
inline   | 
  
 
Definition at line 207 of file cncom.h.
References TVec< TVal, TSizeTy >::Add(), THashSet< TKey, THashFunc >::AddKey(), THashSet< TKey, THashFunc >::Clr(), TSStack< TVal >::Empty(), THash< TKey, TDat, THashFunc >::GetDat(), THashSet< TKey, THashFunc >::GetKeyV(), THash< TKey, TDat, THashFunc >::IsKey(), TMath::Mn(), TSStack< TVal >::Pop(), TVec< TVal, TSizeTy >::Sort(), TSStack< TVal >::Top(), TPair< TVal1, TVal2 >::Val1, and TPair< TVal1, TVal2 >::Val2.
  215       if (! 
Stack.Empty()) {
 
void Clr(const bool &DoDel=true, const int &NoDelLim=-1)
 
static const T & Mn(const T &LVal, const T &RVal)
 
TPair< TInt, TInt > TIntPr
 
void GetKeyV(TVec< TKey > &KeyV) const 
 
THash< TInt, TInt > ParentH
 
const TDat & GetDat(const TKey &Key) const 
 
void Sort(const bool &Asc=true)
Sorts the elements of the vector. 
 
int AddKey(const TKey &Key)
 
THash< TInt, TIntPr > VnLowH
 
bool IsKey(const TKey &Key) const 
 
TSizeTy Add()
Adds a new element at the end of the vector, after its current last element.