TUNGraph::TNodeI Class Reference

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

#include <graph.h>

Collaboration diagram for TUNGraph::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. More...
int	GetInDeg () const
	Returns in-degree of the current node (returns same as value GetDeg() since the graph is undirected). More...
int	GetOutDeg () const
	Returns out-degree of the current node (returns same as value GetDeg() since the graph is undirected). 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	TUNGraph

Detailed Description

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

Definition at line 68 of file graph.h.

Member Typedef Documentation

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

private

Definition at line 70 of file graph.h.

Constructor & Destructor Documentation

TUNGraph::TNodeI::TNodeI ( )

inline

Definition at line 73 of file graph.h.

: NodeHI() { }

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

inline

Definition at line 74 of file graph.h.

: NodeHI(NodeHIter) { }

TUNGraph::TNodeI::TNodeI ( const TNodeI &  NodeI )

inline

Definition at line 75 of file graph.h.

: NodeHI(NodeI.NodeHI) { }

Member Function Documentation

int TUNGraph::TNodeI::GetDeg ( ) const

inline

Returns degree of the current node.

Definition at line 90 of file graph.h.

Referenced by TSnap::GenGeoPrefAttach(), TSnap::GetCmnNbrs< PUNGraph >(), TSnap::GetDegreeCentr(), TLocClustStat::TCutInfo::GetFracDegOut(), TSnap::GetGroupDegreeCentr(), TAGMUtil::GetNbhCom(), TCliqueOverlap::GetNbrs(), TCliqueOverlap::GetNodeIdWithMaxDeg(), TAGMFast::GradientForOneVar(), TAGMFast::GradientForRow(), TCesna::GradientForRow(), TAGMFast::HessianForOneVar(), TSnap::Infomap(), TSnap::TSnapDetail::InfomapOnlineIncrement(), ChibaNishizekiWeighter::Initialize(), TSnap::Intersect(), TSnap::Intersect1(), TAGMFit::JoinCom(), TAGMFit::LeaveCom(), TAGMFast::LikelihoodForOneVar(), TAGMFast::LikelihoodForRow(), TCesna::LikelihoodForRow(), TSnap::TSnapDetail::MapEquationNew2Modules(), TSnap::MaxCPGreedyBetter(), TSnap::MaxCPGreedyBetter1(), TSnap::MaxCPGreedyBetter2(), TSnap::MaxCPGreedyBetter3(), TCliqueOverlap::MaxNbrsInCANDNodeId(), TAGMFast::MLEGradAscent(), TAGMFast::MLEGradAscentParallel(), TCesna::MLEGradAscentParallel(), TAGMFast::MLENewton(), TAGMFast::NeighborComInit(), TAGMFit::NeighborComInit(), TCesna::NeighborComInit(), TAGMFast::RandomInit(), TAGMFit::RandomInit(), TCesna::RandomInit(), TAGMFit::SeekJoin(), TAGMFit::SeekLeave(), and TAGMFit::SeekSwitch().

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

Here is the caller graph for this function:

int TUNGraph::TNodeI::GetId ( ) const

inline

Returns ID of the current node.

Definition at line 88 of file graph.h.

Referenced by TUNGraph::AddNode(), TUNGraph::BegEI(), TSnap::GetGroupDegreeCentr(), TUNGraph::TEdgeI::GetSrcNId(), higherDeg(), TSnap::Intersect(), TSnap::Intersect1(), TSnap::TSnapDetail::MapEquationNew2Modules(), TAGMFit::NeighborComInit(), and TAGMFit::RandomInit().

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

Here is the caller graph for this function:

int TUNGraph::TNodeI::GetInDeg ( ) const

inline

Returns in-degree of the current node (returns same as value GetDeg() since the graph is undirected).

Definition at line 92 of file graph.h.

Referenced by TSnap::GetEgonet().

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

Here is the caller graph for this function:

int TUNGraph::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(). Since the graph is undirected GetInNId(), GetOutNId() and GetNbrNId() all give the same output.

Definition at line 101 of file graph.h.

Referenced by TSnap::GetEgonet().

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

Here is the caller graph for this function:

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

inline

Returns ID of NodeN-th neighboring node.

Range of NodeN: 0 <= NodeN < GetNbrDeg(). Since the graph is undirected GetInNId(), GetOutNId() and GetNbrNId() all give the same output.

Definition at line 111 of file graph.h.

Referenced by TSnap::GetCmnNbrs< PUNGraph >(), TLocClustStat::TCutInfo::GetFracDegOut(), TSnap::GetGroupDegreeCentr(), TAGMUtil::GetNbhCom(), TCliqueOverlap::GetNbrs(), TAGMFast::GradientForOneVar(), TAGMFast::GradientForRow(), TCesna::GradientForRow(), TAGMFast::HessianForOneVar(), TSnap::Infomap(), TSnap::TSnapDetail::InfomapOnlineIncrement(), ChibaNishizekiWeighter::Initialize(), TSnap::Intersect(), TSnap::Intersect1(), TAGMFit::JoinCom(), TAGMFit::LeaveCom(), TAGMFast::LikelihoodForOneVar(), TAGMFast::LikelihoodForRow(), TCesna::LikelihoodForRow(), TSnap::TSnapDetail::MapEquationNew2Modules(), TSnap::MaxCPGreedyBetter(), TSnap::MaxCPGreedyBetter1(), TSnap::MaxCPGreedyBetter2(), TSnap::MaxCPGreedyBetter3(), TCliqueOverlap::MaxNbrsInCANDNodeId(), TAGMFast::MLEGradAscent(), TAGMFast::MLEGradAscentParallel(), TCesna::MLEGradAscentParallel(), TAGMFast::MLENewton(), TAGMFast::NeighborComInit(), TAGMFit::NeighborComInit(), TCesna::NeighborComInit(), TAGMFit::RandomInit(), TAGMFit::SeekJoin(), TAGMFit::SeekLeave(), TAGMFit::SeekSwitch(), and MotifCluster::SemicliqueMotifAdjacency().

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

Here is the caller graph for this function:

int TUNGraph::TNodeI::GetOutDeg ( ) const

inline

Returns out-degree of the current node (returns same as value GetDeg() since the graph is undirected).

Definition at line 94 of file graph.h.

Referenced by TSnap::TSnapDetail::_GirvanNewmanGetModularity(), TLocClust::ApproxPageRank(), TLocClustStat::BagOfWhiskers(), TLocClustStat::BagOfWhiskers2(), TUNGraph::BegEI(), TUndirFFire::BurnGeoFire(), MAPPR::computeAPPR(), MAPPR::computeProfile(), TAGMUtil::GetConductance(), TLocClust::GetCutStat(), TSnap::GetSubGraph(), higherDeg(), TSnap::TSnapDetail::TCNMQMatrix::Init(), TUNGraph::TEdgeI::operator++(), MotifCluster::SemicliqueMotifAdjacency(), and TLocClust::SupportSweep().

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

Here is the caller graph for this function:

int TUNGraph::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(). Since the graph is undirected GetInNId(), GetOutNId() and GetNbrNId() all give the same output.

Definition at line 106 of file graph.h.

Referenced by TLocClust::ApproxPageRank(), TUNGraph::BegEI(), TUndirFFire::BurnGeoFire(), MAPPR::computeAPPR(), MAPPR::computeProfile(), TAGMUtil::GetConductance(), TLocClust::GetCutStat(), TUNGraph::TEdgeI::GetDstNId(), TSnap::GetSubGraph(), and TLocClust::SupportSweep().

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

Here is the caller graph for this function:

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

inline

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

Definition at line 113 of file graph.h.

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

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

inline

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

Definition at line 117 of file graph.h.

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

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

inline

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

Definition at line 115 of file graph.h.

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

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

inline

Increment iterator.

Definition at line 79 of file graph.h.

{ NodeHI++; return *this; }

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

inline

Decrement iterator.

Definition at line 81 of file graph.h.

{ NodeHI--; return *this; }

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

inline

Definition at line 84 of file graph.h.

References NodeHI.

{ return NodeHI < NodeI.NodeHI; }

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

inline

Definition at line 76 of file graph.h.

References NodeHI.

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

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

inline

Definition at line 85 of file graph.h.

References NodeHI.

{ return NodeHI == NodeI.NodeHI; }

void TUNGraph::TNodeI::SortNIdV ( )

inline

Sorts the adjacency lists of the current node.

Definition at line 96 of file graph.h.

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

Friends And Related Function Documentation

friend class TUNGraph

friend

Definition at line 118 of file graph.h.

Member Data Documentation

THashIter TUNGraph::TNodeI::NodeHI

private

Definition at line 71 of file graph.h.

Referenced by TUNGraph::GetEI(), operator<(), operator=(), and operator==().

---

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

• snap-core/graph.h