TNGraph::TNodeI Class Reference

Node iterator. Only forward iteration (operator++) is supported. More...

#include <graph.h>

Collaboration diagram for TNGraph::TNodeI:

Public Member Functions
	TNodeI ()
	TNodeI (const THashIter &NodeHIter)
	TNodeI (const TNodeI &NodeI)
TNodeI &	operator= (const TNodeI &NodeI)
TNodeI &	operator++ (int)
	Increment iterator. More...
TNodeI &	operator-- (int)
	Decrement iterator. More...
bool	operator< (const TNodeI &NodeI) const
bool	operator== (const TNodeI &NodeI) const
int	GetId () const
	Returns ID of the current node. More...
int	GetDeg () const
	Returns degree of the current node, the sum of in-degree and out-degree. More...
int	GetInDeg () const
	Returns in-degree of the current node. More...
int	GetOutDeg () const
	Returns out-degree of the current node. More...
void	SortNIdV ()
	Sorts the adjacency lists of the current node. More...
int	GetInNId (const int &NodeN) const
	Returns ID of NodeN-th in-node (the node pointing to the current node). More...
int	GetOutNId (const int &NodeN) const
	Returns ID of NodeN-th out-node (the node the current node points to). More...
int	GetNbrNId (const int &NodeN) const
	Returns ID of NodeN-th neighboring node. More...
bool	IsInNId (const int &NId) const
	Tests whether node with ID NId points to the current node. More...
bool	IsOutNId (const int &NId) const
	Tests whether the current node points to node with ID NId. More...
bool	IsNbrNId (const int &NId) const
	Tests whether node with ID NId is a neighbor of the current node. More...

Private Types
typedef THash< TInt, TNode >::TIter	THashIter

Private Attributes
THashIter	NodeHI

Friends
class	TNGraph

Detailed Description

Node iterator. Only forward iteration (operator++) is supported.

Definition at line 339 of file graph.h.

Member Typedef Documentation

typedef THash<TInt, TNode>::TIter TNGraph::TNodeI::THashIter

private

Definition at line 341 of file graph.h.

Constructor & Destructor Documentation

TNGraph::TNodeI::TNodeI ( )

inline

Definition at line 344 of file graph.h.

: NodeHI() { }

TNGraph::TNodeI::TNodeI ( const THashIter &  NodeHIter )

inline

Definition at line 345 of file graph.h.

: NodeHI(NodeHIter) { }

TNGraph::TNodeI::TNodeI ( const TNodeI &  NodeI )

inline

Definition at line 346 of file graph.h.

: NodeHI(NodeI.NodeHI) { }

Member Function Documentation

int TNGraph::TNodeI::GetDeg ( ) const

inline

Returns degree of the current node, the sum of in-degree and out-degree.

Definition at line 358 of file graph.h.

References NodeHI.

Referenced by TSnap::CountTriangles(), TSnap::GetEgonet(), TSubGraphEnum< TGraphCounter >::GetSubGraphs(), TSubGraphEnum< TGraphCounter >::GetSubGraphs_recursive(), TSnap::TSnapDetail::inComp(), TCoda::MLEGradAscentParallel(), TCoda::NeighborComInit(), TCodaAnalyzer::Net2ModeCommunities(), and TKroneckerLL::SetBestDegPerm().

{ return NodeHI.GetDat().GetDeg(); }

Here is the caller graph for this function:

int TNGraph::TNodeI::GetId ( ) const

inline

Returns ID of the current node.

Definition at line 356 of file graph.h.

References NodeHI.

Referenced by TNGraph::AddNode(), TSnap::CountTriangles(), TGHash< TDat >::GetNodeMap(), TNGraph::TEdgeI::GetSrcNId(), and TSubGraphsEnum::RecurBfs().

{ return NodeHI.GetDat().GetId(); }

Here is the caller graph for this function:

int TNGraph::TNodeI::GetInDeg ( ) const

inline

Returns in-degree of the current node.

Definition at line 360 of file graph.h.

References NodeHI.

Referenced by anonymous_namespace{randwalk.h}::ApproxContributionsBalanced(), TForestFire::BurnExpFire(), TForestFire::BurnGeoFire(), TSnap::GetEgonet(), TSnap::GetMergeSortedV(), TCascade::GetProb(), TCoda::GradientForNode(), TCoda::LikelihoodForNode(), TCoda::MLEGradAscent(), TCoda::MLEGradAscentParallel(), TCoda::NeighborComInit(), TCodaAnalyzer::Net2ModeCommunities(), TKroneckerLL::NodeDLLDelta(), TKroneckerLL::NodeLLDelta(), TCoda::RandomInit(), TSubGraphsEnum::RecurBfs(), TSubGraphsEnum::RecurBfs1(), TSnap::ReebRefine(), TSnap::ReebSimplify(), and TMAGFitBern::UpdateApxPhiMI().

{ return NodeHI.GetDat().GetInDeg(); }

Here is the caller graph for this function:

int TNGraph::TNodeI::GetInNId ( const int &  NodeN ) const

inline

Returns ID of NodeN-th in-node (the node pointing to the current node).

Range of NodeN: 0 <= NodeN < GetInDeg().

Definition at line 368 of file graph.h.

References NodeHI.

Referenced by anonymous_namespace{randwalk.h}::ApproxContributionsBalanced(), TForestFire::BurnExpFire(), TForestFire::BurnGeoFire(), TSnap::GetEgonet(), TSnap::GetMergeSortedV(), TCascade::GetProb(), TCoda::GradientForNode(), TCoda::LikelihoodForNode(), TCoda::MLEGradAscent(), TCoda::MLEGradAscentParallel(), TKroneckerLL::NodeDLLDelta(), TKroneckerLL::NodeLLDelta(), TSubGraphsEnum::RecurBfs(), TSubGraphsEnum::RecurBfs1(), TSnap::ReebRefine(), TSnap::ReebSimplify(), and TMAGFitBern::UpdateApxPhiMI().

{ return NodeHI.GetDat().GetInNId(NodeN); }

Here is the caller graph for this function:

int TNGraph::TNodeI::GetNbrNId ( const int &  NodeN ) const

inline

Returns ID of NodeN-th neighboring node.

Range of NodeN: 0 <= NodeN < GetNbrDeg().

Definition at line 376 of file graph.h.

References NodeHI.

Referenced by TSnap::GetEgonet(), TGraphEnumUtils::GetIndGraph(), TSubGraphEnum< TGraphCounter >::GetSubGraphs(), TSubGraphEnum< TGraphCounter >::GetSubGraphs_recursive(), TCoda::MLEGradAscentParallel(), and TCoda::NeighborComInit().

{ return NodeHI.GetDat().GetNbrNId(NodeN); }

Here is the caller graph for this function:

int TNGraph::TNodeI::GetOutDeg ( ) const

inline

Returns out-degree of the current node.

Definition at line 362 of file graph.h.

References NodeHI.

Referenced by anonymous_namespace{randwalk.h}::ApproxContributionsBalanced(), TNGraph::BegEI(), MotifCluster::BifanMotifAdjacency(), TForestFire::BurnExpFire(), TForestFire::BurnGeoFire(), TKroneckerLL::CalcApxGraphDLL(), TKroneckerLL::CalcApxGraphLL(), TKroneckerLL::CalcGraphLL(), TSnap::CascFind(), TSnap::CascFindMP(), TNetInfBs::GenCascade(), TSnap::GenCopyModel(), TSnap::GetEgonet(), TGraphEnumUtils::GetIndGraph(), TSnap::GetMergeSortedV(), TSnap::GetSubGraph(), TCoda::GradientForNode(), TCoda::LikelihoodForNode(), TCoda::MLEGradAscent(), TCoda::MLEGradAscentParallel(), TCoda::NeighborComInit(), TCodaAnalyzer::Net2ModeCommunities(), TKroneckerLL::NodeDLLDelta(), TKroneckerLL::NodeLLDelta(), TNGraph::TEdgeI::operator++(), TCoda::RandomInit(), TSubGraphsEnum::RecurBfs(), TSubGraphsEnum::RecurBfs1(), TSnap::ReebRefine(), TSnap::ReebSimplify(), TSnap::SamplePersonalizedPageRank(), and TMAGFitBern::UpdateApxPhiMI().

{ return NodeHI.GetDat().GetOutDeg(); }

Here is the caller graph for this function:

int TNGraph::TNodeI::GetOutNId ( const int &  NodeN ) const

inline

Returns ID of NodeN-th out-node (the node the current node points to).

Range of NodeN: 0 <= NodeN < GetOutDeg().

Definition at line 372 of file graph.h.

References NodeHI.

Referenced by MotifCluster::BifanMotifAdjacency(), TForestFire::BurnExpFire(), TForestFire::BurnGeoFire(), TKroneckerLL::CalcApxGraphDLL(), TKroneckerLL::CalcApxGraphLL(), TKroneckerLL::CalcGraphLL(), TSnap::CascFind(), TSnap::CascFindMP(), TNetInfBs::GenCascade(), TSnap::GenCopyModel(), TNGraph::TEdgeI::GetDstNId(), TSnap::GetEgonet(), TSnap::GetMergeSortedV(), TSnap::GetSubGraph(), TCoda::GradientForNode(), TCoda::LikelihoodForNode(), TCoda::MLEGradAscent(), TCoda::MLEGradAscentParallel(), TCodaAnalyzer::Net2ModeCommunities(), TKroneckerLL::NodeDLLDelta(), TKroneckerLL::NodeLLDelta(), TSubGraphsEnum::RecurBfs(), TSubGraphsEnum::RecurBfs1(), TSnap::ReebRefine(), TSnap::ReebSimplify(), TSnap::SamplePersonalizedPageRank(), and TMAGFitBern::UpdateApxPhiMI().

{ return NodeHI.GetDat().GetOutNId(NodeN); }

Here is the caller graph for this function:

bool TNGraph::TNodeI::IsInNId ( const int &  NId ) const

inline

Tests whether node with ID NId points to the current node.

Definition at line 378 of file graph.h.

References NodeHI.

Referenced by IsNbrNId().

{ return NodeHI.GetDat().IsInNId(NId); }

Here is the caller graph for this function:

bool TNGraph::TNodeI::IsNbrNId ( const int &  NId ) const

inline

Tests whether node with ID NId is a neighbor of the current node.

Definition at line 382 of file graph.h.

References IsInNId(), and IsOutNId().

{ return IsOutNId(NId) || IsInNId(NId); }

Here is the call graph for this function:

bool TNGraph::TNodeI::IsOutNId ( const int &  NId ) const

inline

Tests whether the current node points to node with ID NId.

Definition at line 380 of file graph.h.

References NodeHI.

Referenced by IsNbrNId().

{ return NodeHI.GetDat().IsOutNId(NId); }

Here is the caller graph for this function:

TNodeI& TNGraph::TNodeI::operator++ ( int  )

inline

Increment iterator.

Definition at line 349 of file graph.h.

References NodeHI.

{ NodeHI++; return *this; }

TNodeI& TNGraph::TNodeI::operator-- ( int  )

inline

Decrement iterator.

Definition at line 351 of file graph.h.

References NodeHI.

{ NodeHI--; return *this; }

bool TNGraph::TNodeI::operator< ( const TNodeI &  NodeI ) const

inline

Definition at line 353 of file graph.h.

References NodeHI.

{ return NodeHI < NodeI.NodeHI; }

TNodeI& TNGraph::TNodeI::operator= ( const TNodeI &  NodeI )

inline

Definition at line 347 of file graph.h.

References NodeHI.

{ NodeHI = NodeI.NodeHI; return *this; }

bool TNGraph::TNodeI::operator== ( const TNodeI &  NodeI ) const

inline

Definition at line 354 of file graph.h.

References NodeHI.

{ return NodeHI == NodeI.NodeHI; }

void TNGraph::TNodeI::SortNIdV ( )

inline

Sorts the adjacency lists of the current node.

Definition at line 364 of file graph.h.

References NodeHI.

{ NodeHI.GetDat().SortNIdV(); }

Friends And Related Function Documentation

friend class TNGraph

friend

Definition at line 383 of file graph.h.

Member Data Documentation

THashIter TNGraph::TNodeI::NodeHI

private

Definition at line 342 of file graph.h.

Referenced by GetDeg(), TNGraph::GetEI(), GetId(), GetInDeg(), GetInNId(), GetNbrNId(), GetOutDeg(), GetOutNId(), IsInNId(), IsOutNId(), operator++(), operator--(), operator<(), operator=(), operator==(), and SortNIdV().

---

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

• snap-core/graph.h