TNGraph::TEdgeI Class Reference

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

#include <graph.h>

Public Member Functions
	TEdgeI ()
	TEdgeI (const TNodeI &NodeI, const TNodeI &EndNodeI, const int &EdgeN=0)
	TEdgeI (const TEdgeI &EdgeI)
TEdgeI &	operator= (const TEdgeI &EdgeI)
TEdgeI &	operator++ (int)
	Increment iterator. More...
bool	operator< (const TEdgeI &EdgeI) const
bool	operator== (const TEdgeI &EdgeI) const
int	GetId () const
	Returns edge ID. Always returns -1 since only edges in multigraphs have explicit IDs. More...
int	GetSrcNId () const
	Returns the source node of the edge. More...
int	GetDstNId () const
	Returns the destination node of the edge. More...

Private Attributes
TNodeI	CurNode
TNodeI	EndNode
int	CurEdge

Friends
class	TNGraph

Detailed Description

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

Definition at line 386 of file graph.h.

Constructor & Destructor Documentation

TNGraph::TEdgeI::TEdgeI ( )

inline

Definition at line 391 of file graph.h.

: CurNode(), EndNode(), CurEdge(0) { }

TNGraph::TEdgeI::TEdgeI ( const TNodeI &  NodeI, const TNodeI &  EndNodeI, const int &  EdgeN = 0  )

inline

Definition at line 392 of file graph.h.

: CurNode(NodeI), EndNode(EndNodeI), CurEdge(EdgeN) { }

TNGraph::TEdgeI::TEdgeI ( const TEdgeI &  EdgeI )

inline

Definition at line 393 of file graph.h.

: CurNode(EdgeI.CurNode), EndNode(EdgeI.EndNode), CurEdge(EdgeI.CurEdge) { }

Member Function Documentation

int TNGraph::TEdgeI::GetDstNId ( ) const

inline

Returns the destination node of the edge.

Definition at line 405 of file graph.h.

{ return CurNode.GetOutNId(CurEdge); }

int TNGraph::TEdgeI::GetId ( ) const

inline

Returns edge ID. Always returns -1 since only edges in multigraphs have explicit IDs.

Definition at line 401 of file graph.h.

{ return -1; }

int TNGraph::TEdgeI::GetSrcNId ( ) const

inline

Returns the source node of the edge.

Definition at line 403 of file graph.h.

{ return CurNode.GetId(); }

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

inline

Increment iterator.

Definition at line 396 of file graph.h.

                             { CurEdge++; if (CurEdge >= CurNode.GetOutDeg()) { CurEdge=0; CurNode++;
      while (CurNode < EndNode && CurNode.GetOutDeg()==0) { CurNode++; } }  return *this; }

bool TNGraph::TEdgeI::operator< ( const TEdgeI &  EdgeI ) const

inline

Definition at line 398 of file graph.h.

{ return CurNode<EdgeI.CurNode || (CurNode==EdgeI.CurNode && CurEdge<EdgeI.CurEdge); }

TEdgeI& TNGraph::TEdgeI::operator= ( const TEdgeI &  EdgeI )

inline

Definition at line 394 of file graph.h.

{ if (this!=&EdgeI) { CurNode=EdgeI.CurNode; EndNode=EdgeI.EndNode; CurEdge=EdgeI.CurEdge; }  return *this; }

bool TNGraph::TEdgeI::operator== ( const TEdgeI &  EdgeI ) const

inline

Definition at line 399 of file graph.h.

{ return CurNode == EdgeI.CurNode && CurEdge == EdgeI.CurEdge; }

Friends And Related Function Documentation

friend class TNGraph

friend

Definition at line 406 of file graph.h.

Member Data Documentation

int TNGraph::TEdgeI::CurEdge

private

Definition at line 389 of file graph.h.

TNodeI TNGraph::TEdgeI::CurNode

private

Definition at line 388 of file graph.h.

TNodeI TNGraph::TEdgeI::EndNode

private

Definition at line 388 of file graph.h.

---

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

• snap-core/graph.h