SNAP Library 2.4, User Reference  2015-05-11 19:40:56
SNAP, a general purpose, high performance system for analysis and manipulation of large networks
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
TNEGraph::TEdgeI Class Reference

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

#include <graph.h>

Public Member Functions

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

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 664 of file graph.h.

Member Typedef Documentation

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

Definition at line 666 of file graph.h.

Constructor & Destructor Documentation

TNEGraph::TEdgeI::TEdgeI ( )
inline

Definition at line 670 of file graph.h.

670 : EdgeHI(), Graph(NULL) { }
const TNEGraph * Graph
Definition: graph.h:668
THashIter EdgeHI
Definition: graph.h:667
TNEGraph::TEdgeI::TEdgeI ( const THashIter EdgeHIter,
const TNEGraph GraphPt 
)
inline

Definition at line 671 of file graph.h.

671 : EdgeHI(EdgeHIter), Graph(GraphPt) { }
const TNEGraph * Graph
Definition: graph.h:668
THashIter EdgeHI
Definition: graph.h:667
TNEGraph::TEdgeI::TEdgeI ( const TEdgeI EdgeI)
inline

Definition at line 672 of file graph.h.

672 : EdgeHI(EdgeI.EdgeHI), Graph(EdgeI.Graph) { }
const TNEGraph * Graph
Definition: graph.h:668
THashIter EdgeHI
Definition: graph.h:667

Member Function Documentation

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

Gets destination of an edge.

Definition at line 683 of file graph.h.

683 { return EdgeHI.GetDat().GetDstNId(); }
THashIter EdgeHI
Definition: graph.h:667
int TNEGraph::TEdgeI::GetId ( ) const
inline

Gets edge ID.

Definition at line 679 of file graph.h.

679 { return EdgeHI.GetDat().GetId(); }
THashIter EdgeHI
Definition: graph.h:667
int TNEGraph::TEdgeI::GetSrcNId ( ) const
inline

Gets the source of an edge.

Definition at line 681 of file graph.h.

681 { return EdgeHI.GetDat().GetSrcNId(); }
THashIter EdgeHI
Definition: graph.h:667
TEdgeI& TNEGraph::TEdgeI::operator++ ( int  )
inline

Increment iterator.

Definition at line 675 of file graph.h.

675 { EdgeHI++; return *this; }
THashIter EdgeHI
Definition: graph.h:667
bool TNEGraph::TEdgeI::operator< ( const TEdgeI EdgeI) const
inline

Definition at line 676 of file graph.h.

676 { return EdgeHI < EdgeI.EdgeHI; }
THashIter EdgeHI
Definition: graph.h:667
TEdgeI& TNEGraph::TEdgeI::operator= ( const TEdgeI EdgeI)
inline

Definition at line 673 of file graph.h.

673 { if (this!=&EdgeI) { EdgeHI=EdgeI.EdgeHI; Graph=EdgeI.Graph; } return *this; }
const TNEGraph * Graph
Definition: graph.h:668
THashIter EdgeHI
Definition: graph.h:667
bool TNEGraph::TEdgeI::operator== ( const TEdgeI EdgeI) const
inline

Definition at line 677 of file graph.h.

677 { return EdgeHI == EdgeI.EdgeHI; }
THashIter EdgeHI
Definition: graph.h:667

Friends And Related Function Documentation

friend class TNEGraph
friend

Definition at line 684 of file graph.h.

Member Data Documentation

THashIter TNEGraph::TEdgeI::EdgeHI
private

Definition at line 667 of file graph.h.

const TNEGraph* TNEGraph::TEdgeI::Graph
private

Definition at line 668 of file graph.h.


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