TNEGraph::TNodeI Class Reference

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

#include <graph.h>

Public Member Functions
	TNodeI ()
	TNodeI (const THashIter &NodeHIter, const TNEGraph *GraphPt)
	TNodeI (const TNodeI &NodeI)
TNodeI &	operator= (const TNodeI &NodeI)
TNodeI &	operator++ (int)
	Increment 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...
int	GetInNId (const int &EdgeN) const
	Returns ID of EdgeN-th in-node (the node pointing to the current node). More...
int	GetOutNId (const int &EdgeN) const
	Returns ID of EdgeN-th out-node (the node the current node points to). More...
int	GetNbrNId (const int &EdgeN) const
	Returns ID of EdgeN-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...
int	GetInEId (const int &EdgeN) const
	Returns ID of EdgeN-th in-edge. More...
int	GetOutEId (const int &EdgeN) const
	Returns ID of EdgeN-th out-edge. More...
int	GetNbrEId (const int &EdgeN) const
	Returns ID of EdgeN-th in or out-edge. More...
bool	IsInEId (const int &EId) const
	Tests whether the edge with ID EId is an in-edge of current node. More...
bool	IsOutEId (const int &EId) const
	Tests whether the edge with ID EId is an out-edge of current node. More...
bool	IsNbrEId (const int &EId) const
	Tests whether the edge with ID EId is an in or out-edge of current node. More...

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

Private Attributes
THashIter	NodeHI
const TNEGraph *	Graph

Friends
class	TNEGraph

Detailed Description

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

Definition at line 598 of file graph.h.

Member Typedef Documentation

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

private

Definition at line 600 of file graph.h.

Constructor & Destructor Documentation

TNEGraph::TNodeI::TNodeI ( )

inline

Definition at line 604 of file graph.h.

: NodeHI(), Graph(NULL) { }

TNEGraph::TNodeI::TNodeI ( const THashIter &  NodeHIter, const TNEGraph *  GraphPt  )

inline

Definition at line 605 of file graph.h.

: NodeHI(NodeHIter), Graph(GraphPt) { }

TNEGraph::TNodeI::TNodeI ( const TNodeI &  NodeI )

inline

Definition at line 606 of file graph.h.

: NodeHI(NodeI.NodeHI), Graph(NodeI.Graph) { }

Member Function Documentation

int TNEGraph::TNodeI::GetDeg ( ) const

inline

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

Definition at line 615 of file graph.h.

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

int TNEGraph::TNodeI::GetId ( ) const

inline

Returns ID of the current node.

Definition at line 613 of file graph.h.

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

int TNEGraph::TNodeI::GetInDeg ( ) const

inline

Returns in-degree of the current node.

Definition at line 617 of file graph.h.

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

int TNEGraph::TNodeI::GetInEId ( const int &  EdgeN ) const

inline

Returns ID of EdgeN-th in-edge.

Definition at line 641 of file graph.h.

{ return NodeHI.GetDat().GetInEId(EdgeN); }

int TNEGraph::TNodeI::GetInNId ( const int &  EdgeN ) const

inline

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

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

Definition at line 623 of file graph.h.

{ return Graph->GetEdge(NodeHI.GetDat().GetInEId(EdgeN)).GetSrcNId(); }

int TNEGraph::TNodeI::GetNbrEId ( const int &  EdgeN ) const

inline

Returns ID of EdgeN-th in or out-edge.

Definition at line 645 of file graph.h.

{ return NodeHI.GetDat().GetNbrEId(EdgeN); }

int TNEGraph::TNodeI::GetNbrNId ( const int &  EdgeN ) const

inline

Returns ID of EdgeN-th neighboring node.

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

Definition at line 631 of file graph.h.

                                          { const TEdge& E = Graph->GetEdge(NodeHI.GetDat().GetNbrEId(EdgeN));
      return GetId()==E.GetSrcNId() ? E.GetDstNId():E.GetSrcNId(); }

int TNEGraph::TNodeI::GetOutDeg ( ) const

inline

Returns out-degree of the current node.

Definition at line 619 of file graph.h.

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

int TNEGraph::TNodeI::GetOutEId ( const int &  EdgeN ) const

inline

Returns ID of EdgeN-th out-edge.

Definition at line 643 of file graph.h.

{ return NodeHI.GetDat().GetOutEId(EdgeN); }

int TNEGraph::TNodeI::GetOutNId ( const int &  EdgeN ) const

inline

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

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

Definition at line 627 of file graph.h.

{ return Graph->GetEdge(NodeHI.GetDat().GetOutEId(EdgeN)).GetDstNId(); }

bool TNEGraph::TNodeI::IsInEId ( const int &  EId ) const

inline

Tests whether the edge with ID EId is an in-edge of current node.

Definition at line 647 of file graph.h.

{ return NodeHI.GetDat().IsInEId(EId); }

bool TNEGraph::TNodeI::IsInNId

(

const int &

NId

)

const

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

Definition at line 418 of file graph.cpp.

                                                 {
  const TNode& Node = NodeHI.GetDat();
  for (int edge = 0; edge < Node.GetInDeg(); edge++) {
    if (NId == Graph->GetEdge(Node.GetInEId(edge)).GetSrcNId())
      return true;
  }
  return false;
}

bool TNEGraph::TNodeI::IsNbrEId ( const int &  EId ) const

inline

Tests whether the edge with ID EId is an in or out-edge of current node.

Definition at line 651 of file graph.h.

{ return IsInEId(EId) || IsOutEId(EId); }

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

inline

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

Definition at line 638 of file graph.h.

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

bool TNEGraph::TNodeI::IsOutEId ( const int &  EId ) const

inline

Tests whether the edge with ID EId is an out-edge of current node.

Definition at line 649 of file graph.h.

{ return NodeHI.GetDat().IsOutEId(EId); }

bool TNEGraph::TNodeI::IsOutNId

(

const int &

NId

)

const

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

Definition at line 427 of file graph.cpp.

                                                  {
  const TNode& Node = NodeHI.GetDat();
  for (int edge = 0; edge < Node.GetOutDeg(); edge++) {
    if (NId == Graph->GetEdge(Node.GetOutEId(edge)).GetDstNId())
      return true;
  }
  return false;
}

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

inline

Increment iterator.

Definition at line 609 of file graph.h.

{ NodeHI++; return *this; }

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

inline

Definition at line 610 of file graph.h.

{ return NodeHI < NodeI.NodeHI; }

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

inline

Definition at line 607 of file graph.h.

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

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

inline

Definition at line 611 of file graph.h.

{ return NodeHI == NodeI.NodeHI; }

Friends And Related Function Documentation

friend class TNEGraph

friend

Definition at line 652 of file graph.h.

Member Data Documentation

const TNEGraph* TNEGraph::TNodeI::Graph

private

Definition at line 602 of file graph.h.

THashIter TNEGraph::TNodeI::NodeHI

private

Definition at line 601 of file graph.h.

---

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

• snap-core/graph.h
• snap-core/graph.cpp