SNAP Library 2.3, User Reference  2014-06-16 11:58:46
SNAP, a general purpose, high performance system for analysis and manipulation of large networks
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
TBPGraph::TNode Class Reference

#include <graph.h>

Public Member Functions

 TNode ()
 
 TNode (const int &NId)
 
 TNode (const TNode &Node)
 
 TNode (TSIn &SIn)
 
void Save (TSOut &SOut) const
 
int GetId () const
 
int GetDeg () const
 
int GetInDeg () const
 
int GetOutDeg () const
 
int GetInNId (const int &NodeN) const
 
int GetOutNId (const int &NodeN) const
 
int GetNbrNId (const int &NodeN) const
 
bool IsNbrNId (const int &NId) const
 
bool IsInNId (const int &NId) const
 
bool IsOutNId (const int &NId) const
 
void PackOutNIdV ()
 
void PackNIdV ()
 

Private Attributes

TInt Id
 
TIntV NIdV
 
TNodeTy NodeTy
 

Friends

class TBPGraph
 

Detailed Description

Definition at line 831 of file graph.h.

Constructor & Destructor Documentation

TBPGraph::TNode::TNode ( )
inline

Definition at line 837 of file graph.h.

837 : Id(-1), NIdV(), NodeTy(bgsUndef) { }
TNodeTy NodeTy
Definition: graph.h:835
TIntV NIdV
Definition: graph.h:834
TBPGraph::TNode::TNode ( const int &  NId)
inline

Definition at line 838 of file graph.h.

838 : Id(NId), NIdV(), NodeTy(true?bgsLeft:bgsRight) { }
TNodeTy NodeTy
Definition: graph.h:835
TIntV NIdV
Definition: graph.h:834
TBPGraph::TNode::TNode ( const TNode Node)
inline

Definition at line 839 of file graph.h.

839 : Id(Node.Id), NIdV(Node.NIdV), NodeTy(Node.NodeTy) { }
TNodeTy NodeTy
Definition: graph.h:835
TIntV NIdV
Definition: graph.h:834
TBPGraph::TNode::TNode ( TSIn SIn)
inline

Definition at line 840 of file graph.h.

840 : Id(SIn), NIdV(SIn), NodeTy(bgsUndef) { TInt Ty(SIn); NodeTy=(TNodeTy)Ty.Val; }
TNodeTy NodeTy
Definition: graph.h:835
TNodeTy
Definition: graph.h:829
TIntV NIdV
Definition: graph.h:834
Definition: dt.h:1041

Member Function Documentation

int TBPGraph::TNode::GetDeg ( ) const
inline

Definition at line 843 of file graph.h.

843 { return NIdV.Len(); }
TSizeTy Len() const
Returns the number of elements in the vector.
Definition: ds.h:535
TIntV NIdV
Definition: graph.h:834
int TBPGraph::TNode::GetId ( ) const
inline

Definition at line 842 of file graph.h.

842 { return Id; }
int TBPGraph::TNode::GetInDeg ( ) const
inline

Definition at line 844 of file graph.h.

844 { return GetDeg(); }
int GetDeg() const
Definition: graph.h:843
int TBPGraph::TNode::GetInNId ( const int &  NodeN) const
inline

Definition at line 846 of file graph.h.

846 { return GetNbrNId(NodeN); }
int GetNbrNId(const int &NodeN) const
Definition: graph.h:848
int TBPGraph::TNode::GetNbrNId ( const int &  NodeN) const
inline

Definition at line 848 of file graph.h.

848 { return NIdV[NodeN]; }
TIntV NIdV
Definition: graph.h:834
int TBPGraph::TNode::GetOutDeg ( ) const
inline

Definition at line 845 of file graph.h.

845 { return GetDeg(); }
int GetDeg() const
Definition: graph.h:843
int TBPGraph::TNode::GetOutNId ( const int &  NodeN) const
inline

Definition at line 847 of file graph.h.

847 { return GetNbrNId(NodeN); }
int GetNbrNId(const int &NodeN) const
Definition: graph.h:848
bool TBPGraph::TNode::IsInNId ( const int &  NId) const
inline

Definition at line 850 of file graph.h.

850 { return IsNbrNId(NId); }
bool IsNbrNId(const int &NId) const
Definition: graph.h:849
bool TBPGraph::TNode::IsNbrNId ( const int &  NId) const
inline

Definition at line 849 of file graph.h.

849 { return NIdV.SearchBin(NId)!=-1; }
TIntV NIdV
Definition: graph.h:834
TSizeTy SearchBin(const TVal &Val) const
Returns the position of an element with value Val.
Definition: ds.h:1418
bool TBPGraph::TNode::IsOutNId ( const int &  NId) const
inline

Definition at line 851 of file graph.h.

851 { return IsNbrNId(NId); }
bool IsNbrNId(const int &NId) const
Definition: graph.h:849
void TBPGraph::TNode::PackNIdV ( )
inline

Definition at line 853 of file graph.h.

853 { NIdV.Pack(); }
TIntV NIdV
Definition: graph.h:834
void Pack()
The vector reduces its capacity (frees memory) to match its size.
Definition: ds.h:987
void TBPGraph::TNode::PackOutNIdV ( )
inline

Definition at line 852 of file graph.h.

852 { NIdV.Pack(); }
TIntV NIdV
Definition: graph.h:834
void Pack()
The vector reduces its capacity (frees memory) to match its size.
Definition: ds.h:987
void TBPGraph::TNode::Save ( TSOut SOut) const
inline

Definition at line 841 of file graph.h.

841 { Id.Save(SOut); NIdV.Save(SOut); TInt(NodeTy).Save(SOut); }
TNodeTy NodeTy
Definition: graph.h:835
void Save(TSOut &SOut) const
Definition: dt.h:1057
void Save(TSOut &SOut) const
Definition: ds.h:885
TIntV NIdV
Definition: graph.h:834
Definition: dt.h:1041

Friends And Related Function Documentation

friend class TBPGraph
friend

Definition at line 854 of file graph.h.

Member Data Documentation

TInt TBPGraph::TNode::Id
private

Definition at line 833 of file graph.h.

TIntV TBPGraph::TNode::NIdV
private

Definition at line 834 of file graph.h.

TNodeTy TBPGraph::TNode::NodeTy
private

Definition at line 835 of file graph.h.


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