TNodeNet< TNodeData >::TEdgeI Class Reference

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

#include <network.h>

Collaboration diagram for TNodeNet< TNodeData >::TEdgeI:

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
	Gets edge ID. Always returns -1 since only edges in multigraphs have explicit IDs. More...
int	GetSrcNId () const
	Gets the source node of an edge. More...
int	GetDstNId () const
	Gets the destination node of an edge. More...
const TNodeData &	GetSrcNDat () const
TNodeData &	GetDstNDat ()

Private Attributes
TNodeI	CurNode
TNodeI	EndNode
int	CurEdge

Friends
class	TNodeNet< TNodeData >

Detailed Description

template<class TNodeData>
class TNodeNet< TNodeData >::TEdgeI

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

Definition at line 113 of file network.h.

Constructor & Destructor Documentation

template<class TNodeData>

TNodeNet< TNodeData >::TEdgeI::TEdgeI ( )

inline

Definition at line 118 of file network.h.

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

template<class TNodeData>

TNodeNet< TNodeData >::TEdgeI::TEdgeI ( const TNodeI &  NodeI, const TNodeI &  EndNodeI, const int &  EdgeN = 0  )

inline

Definition at line 119 of file network.h.

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

template<class TNodeData>

TNodeNet< TNodeData >::TEdgeI::TEdgeI ( const TEdgeI &  EdgeI )

inline

Definition at line 120 of file network.h.

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

Member Function Documentation

template<class TNodeData>

TNodeData& TNodeNet< TNodeData >::TEdgeI::GetDstNDat ( )

inline

Definition at line 134 of file network.h.

References TNodeNet< TNodeData >::TNodeI::GetOutNDat().

{ return CurNode.GetOutNDat(CurEdge); }

Here is the call graph for this function:

template<class TNodeData>

int TNodeNet< TNodeData >::TEdgeI::GetDstNId ( ) const

inline

Gets the destination node of an edge.

Definition at line 132 of file network.h.

References TNodeNet< TNodeData >::TNodeI::GetOutNId().

{ return CurNode.GetOutNId(CurEdge); }

Here is the call graph for this function:

template<class TNodeData>

int TNodeNet< TNodeData >::TEdgeI::GetId ( ) const

inline

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

Definition at line 128 of file network.h.

{ return -1; }

template<class TNodeData>

const TNodeData& TNodeNet< TNodeData >::TEdgeI::GetSrcNDat ( ) const

inline

Definition at line 133 of file network.h.

References TNodeNet< TNodeData >::TNodeI::GetDat().

{ return CurNode.GetDat(); }

Here is the call graph for this function:

template<class TNodeData>

int TNodeNet< TNodeData >::TEdgeI::GetSrcNId ( ) const

inline

Gets the source node of an edge.

Definition at line 130 of file network.h.

References TNodeNet< TNodeData >::TNodeI::GetId().

{ return CurNode.GetId(); }

Here is the call graph for this function:

template<class TNodeData>

TEdgeI& TNodeNet< TNodeData >::TEdgeI::operator++ ( int  )

inline

Increment iterator.

Definition at line 123 of file network.h.

References TNodeNet< TNodeData >::TNodeI::GetOutDeg().

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

Here is the call graph for this function:

template<class TNodeData>

bool TNodeNet< TNodeData >::TEdgeI::operator< ( const TEdgeI &  EdgeI ) const

inline

Definition at line 125 of file network.h.

References TNodeNet< TNodeData >::TEdgeI::CurEdge, and TNodeNet< TNodeData >::TEdgeI::CurNode.

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

template<class TNodeData>

TEdgeI& TNodeNet< TNodeData >::TEdgeI::operator= ( const TEdgeI &  EdgeI )

inline

Definition at line 121 of file network.h.

References TNodeNet< TNodeData >::TEdgeI::CurEdge, TNodeNet< TNodeData >::TEdgeI::CurNode, and TNodeNet< TNodeData >::TEdgeI::EndNode.

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

template<class TNodeData>

bool TNodeNet< TNodeData >::TEdgeI::operator== ( const TEdgeI &  EdgeI ) const

inline

Definition at line 126 of file network.h.

References TNodeNet< TNodeData >::TEdgeI::CurEdge, and TNodeNet< TNodeData >::TEdgeI::CurNode.

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

Friends And Related Function Documentation

template<class TNodeData>

friend class TNodeNet< TNodeData >

friend

Definition at line 135 of file network.h.

Member Data Documentation

template<class TNodeData>

int TNodeNet< TNodeData >::TEdgeI::CurEdge

private

Definition at line 116 of file network.h.

Referenced by TNodeNet< TNodeData >::TEdgeI::operator<(), TNodeNet< TNodeData >::TEdgeI::operator=(), and TNodeNet< TNodeData >::TEdgeI::operator==().

template<class TNodeData>

TNodeI TNodeNet< TNodeData >::TEdgeI::CurNode

private

Definition at line 115 of file network.h.

Referenced by TNodeNet< TNodeData >::TEdgeI::operator<(), TNodeNet< TNodeData >::TEdgeI::operator=(), and TNodeNet< TNodeData >::TEdgeI::operator==().

template<class TNodeData>

TNodeI TNodeNet< TNodeData >::TEdgeI::EndNode

private

Definition at line 115 of file network.h.

Referenced by TNodeNet< TNodeData >::TEdgeI::operator=().

---

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

• snap-core/network.h