SNAP Library 6.0, Developer Reference  2020-12-09 16:24:20
SNAP, a general purpose, high performance system for analysis and manipulation of large networks
TLocClustStat::TNodeSweep Class Reference

#include <ncp.h>

Collaboration diagram for TLocClustStat::TNodeSweep:

Public Member Functions

 TNodeSweep ()
 
 TNodeSweep (const int &SeedNode, const TIntV &SweepNIdV, const TFltV &PhiNIdV)
 
 TNodeSweep (const TNodeSweep &NS)
 
int Len () const
 
int GetSeed () const
 
int NId (const int i) const
 
double Phi (const int i) const
 
bool operator< (const TNodeSweep &CS) const
 

Public Attributes

TInt SeedNId
 
TIntV SweepV
 
TFltV PhiV
 

Detailed Description

Definition at line 130 of file ncp.h.

Constructor & Destructor Documentation

TLocClustStat::TNodeSweep::TNodeSweep ( )
inline

Definition at line 136 of file ncp.h.

136 {}
TLocClustStat::TNodeSweep::TNodeSweep ( const int &  SeedNode,
const TIntV SweepNIdV,
const TFltV PhiNIdV 
)
inline

Definition at line 137 of file ncp.h.

References IAssert, and TVec< TVal, TSizeTy >::Len().

137  :
138  SeedNId(SeedNode), SweepV(SweepNIdV), PhiV(PhiNIdV) { IAssert(SweepV.Len()==PhiV.Len()); }
#define IAssert(Cond)
Definition: bd.h:262
TSizeTy Len() const
Returns the number of elements in the vector.
Definition: ds.h:575

Here is the call graph for this function:

TLocClustStat::TNodeSweep::TNodeSweep ( const TNodeSweep NS)
inline

Definition at line 139 of file ncp.h.

139 : SeedNId(NS.SeedNId), SweepV(NS.SweepV), PhiV(NS.PhiV) { }

Member Function Documentation

int TLocClustStat::TNodeSweep::GetSeed ( ) const
inline

Definition at line 141 of file ncp.h.

References SeedNId.

141 { return SeedNId; }
int TLocClustStat::TNodeSweep::Len ( ) const
inline

Definition at line 140 of file ncp.h.

References TVec< TVal, TSizeTy >::Len().

Referenced by TLocClustStat::FindBestCut(), and operator<().

140 { return SweepV.Len(); }
TSizeTy Len() const
Returns the number of elements in the vector.
Definition: ds.h:575

Here is the call graph for this function:

Here is the caller graph for this function:

int TLocClustStat::TNodeSweep::NId ( const int  i) const
inline

Definition at line 142 of file ncp.h.

Referenced by TLocClustStat::FindBestCut().

142 { return SweepV[i]; }

Here is the caller graph for this function:

bool TLocClustStat::TNodeSweep::operator< ( const TNodeSweep CS) const
inline

Definition at line 144 of file ncp.h.

References Len().

144 { return Len() < CS.Len(); }
int Len() const
Definition: ncp.h:140

Here is the call graph for this function:

double TLocClustStat::TNodeSweep::Phi ( const int  i) const
inline

Definition at line 143 of file ncp.h.

Referenced by TLocClustStat::FindBestCut().

143 { return PhiV[i]; }

Here is the caller graph for this function:

Member Data Documentation

TFltV TLocClustStat::TNodeSweep::PhiV

Definition at line 134 of file ncp.h.

TInt TLocClustStat::TNodeSweep::SeedNId

Definition at line 132 of file ncp.h.

Referenced by GetSeed().

TIntV TLocClustStat::TNodeSweep::SweepV

Definition at line 133 of file ncp.h.


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