| 
    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 
   | 
 
Node iterator. Only forward iteration (operator++) is supported. More...
#include <network.h>

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 network is undirected).  More... | |
| int | GetOutDeg () const | 
| Returns out-degree of the current node (returns same as value GetDeg() since the network 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 | TUndirNet | 
Node iterator. Only forward iteration (operator++) is supported.
      
  | 
  private | 
      
  | 
  inline | 
      
  | 
  inline | 
      
  | 
  inline | 
Returns ID of the current node.
Definition at line 3453 of file network.h.
Referenced by TUndirNet::AddNode(), TUndirNet::AddSAttrDatN(), TUndirNet::BegEI(), TUndirNet::DelSAttrDatN(), TUndirNet::GetSAttrDatN(), TUndirNet::GetSAttrVN(), and TUndirNet::TEdgeI::GetSrcNId().

      
  | 
  inline | 
      
  | 
  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 3466 of file network.h.
      
  | 
  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 3476 of file network.h.
      
  | 
  inline | 
Returns out-degree of the current node (returns same as value GetDeg() since the network is undirected).
Definition at line 3459 of file network.h.
Referenced by TUndirNet::BegEI(), and TUndirNet::TEdgeI::operator++().

      
  | 
  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 3471 of file network.h.
Referenced by TUndirNet::BegEI(), and TUndirNet::TEdgeI::GetDstNId().

      
  | 
  inline | 
      
  | 
  inline | 
      
  | 
  inline | 
      
  | 
  inline | 
      
  | 
  inline | 
      
  | 
  inline | 
      
  | 
  inline | 
      
  | 
  inline | 
      
  | 
  private | 
Definition at line 3436 of file network.h.
Referenced by TUndirNet::GetEI(), operator<(), operator=(), and operator==().