SNAP Library 2.2, Developer Reference  2014-03-11 19:15:55
SNAP, a general purpose, high performance system for analysis and manipulation of large networks
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines
TNEGraph::TEdgeI Class Reference

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

#include <graph.h>

Collaboration diagram for TNEGraph::TEdgeI:

List of all members.

Public Member Functions

 TEdgeI ()
 TEdgeI (const THashIter &EdgeHIter, const TNEGraph *GraphPt)
 TEdgeI (const TEdgeI &EdgeI)
TEdgeIoperator= (const TEdgeI &EdgeI)
TEdgeIoperator++ (int)
 Increment iterator.
bool operator< (const TEdgeI &EdgeI) const
bool operator== (const TEdgeI &EdgeI) const
int GetId () const
 Gets edge ID.
int GetSrcNId () const
 Gets the source of an edge.
int GetDstNId () const
 Gets destination of an edge.

Private Types

typedef THash< TInt, TEdge >::TIter THashIter

Private Attributes

THashIter EdgeHI
const TNEGraphGraph

Friends

class TNEGraph

Detailed Description

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

Definition at line 655 of file graph.h.


Member Typedef Documentation

typedef THash<TInt, TEdge>::TIter TNEGraph::TEdgeI::THashIter [private]

Definition at line 657 of file graph.h.


Constructor & Destructor Documentation

Definition at line 661 of file graph.h.

: EdgeHI(), Graph(NULL) { }
TNEGraph::TEdgeI::TEdgeI ( const THashIter EdgeHIter,
const TNEGraph GraphPt 
) [inline]

Definition at line 662 of file graph.h.

: EdgeHI(EdgeHIter), Graph(GraphPt) { }
TNEGraph::TEdgeI::TEdgeI ( const TEdgeI EdgeI) [inline]

Definition at line 663 of file graph.h.

: EdgeHI(EdgeI.EdgeHI), Graph(EdgeI.Graph) { }

Member Function Documentation

int TNEGraph::TEdgeI::GetDstNId ( ) const [inline]

Gets destination of an edge.

Definition at line 674 of file graph.h.

References EdgeHI.

Referenced by TNEGraph::AddEdge().

{ return EdgeHI.GetDat().GetDstNId(); }

Here is the caller graph for this function:

int TNEGraph::TEdgeI::GetId ( ) const [inline]

Gets edge ID.

Definition at line 670 of file graph.h.

References EdgeHI.

Referenced by TNEGraph::AddEdge().

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

Here is the caller graph for this function:

int TNEGraph::TEdgeI::GetSrcNId ( ) const [inline]

Gets the source of an edge.

Definition at line 672 of file graph.h.

References EdgeHI.

Referenced by TNEGraph::AddEdge().

{ return EdgeHI.GetDat().GetSrcNId(); }

Here is the caller graph for this function:

TEdgeI& TNEGraph::TEdgeI::operator++ ( int  ) [inline]

Increment iterator.

Definition at line 666 of file graph.h.

References EdgeHI.

{ EdgeHI++; return *this; }
bool TNEGraph::TEdgeI::operator< ( const TEdgeI EdgeI) const [inline]

Definition at line 667 of file graph.h.

References EdgeHI.

{ return EdgeHI < EdgeI.EdgeHI; }
TEdgeI& TNEGraph::TEdgeI::operator= ( const TEdgeI EdgeI) [inline]

Definition at line 664 of file graph.h.

References EdgeHI, and Graph.

{ if (this!=&EdgeI) { EdgeHI=EdgeI.EdgeHI; Graph=EdgeI.Graph; }  return *this; }
bool TNEGraph::TEdgeI::operator== ( const TEdgeI EdgeI) const [inline]

Definition at line 668 of file graph.h.

References EdgeHI.

{ return EdgeHI == EdgeI.EdgeHI; }

Friends And Related Function Documentation

friend class TNEGraph [friend]

Definition at line 675 of file graph.h.


Member Data Documentation

Definition at line 659 of file graph.h.

Referenced by operator=().


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