SNAP Library 4.1, Developer Reference  2018-07-26 16:30:42
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
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)
 
TNodeIoperator= (const TNodeI &NodeI)
 
TNodeIoperator++ (int)
 Increment iterator. More...
 
TNodeIoperator-- (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 379 of file graph.h.

Member Typedef Documentation

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

Definition at line 381 of file graph.h.

Constructor & Destructor Documentation

TNGraph::TNodeI::TNodeI ( )
inline

Definition at line 384 of file graph.h.

384 : NodeHI() { }
THashIter NodeHI
Definition: graph.h:382
TNGraph::TNodeI::TNodeI ( const THashIter NodeHIter)
inline

Definition at line 385 of file graph.h.

385 : NodeHI(NodeHIter) { }
THashIter NodeHI
Definition: graph.h:382
TNGraph::TNodeI::TNodeI ( const TNodeI NodeI)
inline

Definition at line 386 of file graph.h.

386 : NodeHI(NodeI.NodeHI) { }
THashIter NodeHI
Definition: graph.h:382

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 398 of file graph.h.

References NodeHI.

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

398 { return NodeHI.GetDat().GetDeg(); }
THashIter NodeHI
Definition: graph.h:382

Here is the caller graph for this function:

int TNGraph::TNodeI::GetId ( ) const
inline

Returns ID of the current node.

Definition at line 396 of file graph.h.

References NodeHI.

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

396 { return NodeHI.GetDat().GetId(); }
THashIter NodeHI
Definition: graph.h:382

Here is the caller graph for this function:

int TNGraph::TNodeI::GetInNId ( const int &  NodeN) const
inline
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 416 of file graph.h.

References NodeHI.

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

416 { return NodeHI.GetDat().GetNbrNId(NodeN); }
THashIter NodeHI
Definition: graph.h:382

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 418 of file graph.h.

References NodeHI.

Referenced by IsNbrNId().

418 { return NodeHI.GetDat().IsInNId(NId); }
THashIter NodeHI
Definition: graph.h:382

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 422 of file graph.h.

References IsInNId(), and IsOutNId().

422 { return IsOutNId(NId) || IsInNId(NId); }
bool IsInNId(const int &NId) const
Tests whether node with ID NId points to the current node.
Definition: graph.h:418
bool IsOutNId(const int &NId) const
Tests whether the current node points to node with ID NId.
Definition: graph.h:420

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 420 of file graph.h.

References NodeHI.

Referenced by TempMotifCounter::GetAllNeighbors(), and IsNbrNId().

420 { return NodeHI.GetDat().IsOutNId(NId); }
THashIter NodeHI
Definition: graph.h:382

Here is the caller graph for this function:

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

Increment iterator.

Definition at line 389 of file graph.h.

References NodeHI.

389 { NodeHI++; return *this; }
THashIter NodeHI
Definition: graph.h:382
TNodeI& TNGraph::TNodeI::operator-- ( int  )
inline

Decrement iterator.

Definition at line 391 of file graph.h.

References NodeHI.

391 { NodeHI--; return *this; }
THashIter NodeHI
Definition: graph.h:382
bool TNGraph::TNodeI::operator< ( const TNodeI NodeI) const
inline

Definition at line 393 of file graph.h.

References NodeHI.

393 { return NodeHI < NodeI.NodeHI; }
THashIter NodeHI
Definition: graph.h:382
TNodeI& TNGraph::TNodeI::operator= ( const TNodeI NodeI)
inline

Definition at line 387 of file graph.h.

References NodeHI.

387 { NodeHI = NodeI.NodeHI; return *this; }
THashIter NodeHI
Definition: graph.h:382
bool TNGraph::TNodeI::operator== ( const TNodeI NodeI) const
inline

Definition at line 394 of file graph.h.

References NodeHI.

394 { return NodeHI == NodeI.NodeHI; }
THashIter NodeHI
Definition: graph.h:382
void TNGraph::TNodeI::SortNIdV ( )
inline

Sorts the adjacency lists of the current node.

Definition at line 404 of file graph.h.

References NodeHI.

404 { NodeHI.GetDat().SortNIdV(); }
THashIter NodeHI
Definition: graph.h:382

Friends And Related Function Documentation

friend class TNGraph
friend

Definition at line 423 of file graph.h.

Member Data Documentation


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