SNAP Library 2.1, Developer Reference  2013-09-25 10:47:25
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
Public Member Functions | Private Attributes | Friends
TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI Class Reference

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

#include <network.h>

Collaboration diagram for TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI:
Collaboration graph
[legend]

List of all members.

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.
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.
int GetSrcNId () const
 Gets the source node of an edge.
int GetDstNId () const
 Gets the destination node of an edge.
TEdgeData & operator() ()
const TEdgeData & operator() () const
TEdgeData & GetDat ()
const TEdgeData & GetDat () const
TNodeData & GetSrcNDat ()
const TNodeData & GetSrcNDat () const
TNodeData & GetDstNDat ()
const TNodeData & GetDstNDat () const

Private Attributes

TNodeI CurNode
TNodeI EndNode
int CurEdge

Friends

class TNodeEDatNet< TNodeData, TEdgeData >

Detailed Description

template<class TNodeData, class TEdgeData>
class TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI

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

Definition at line 544 of file network.h.

Constructor & Destructor Documentation

template<class TNodeData, class TEdgeData>
TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::TEdgeI ( ) [inline]

Definition at line 549 of file network.h.

: CurNode(), EndNode(), CurEdge(0) { }
template<class TNodeData, class TEdgeData>
TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::TEdgeI ( const TNodeI &  NodeI,
const TNodeI &  EndNodeI,
const int &  EdgeN = 0 
) [inline]

Definition at line 550 of file network.h.

: CurNode(NodeI), EndNode(EndNodeI), CurEdge(EdgeN) { }
template<class TNodeData, class TEdgeData>
TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::TEdgeI ( const TEdgeI &  EdgeI) [inline]

Definition at line 551 of file network.h.

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

Member Function Documentation

template<class TNodeData, class TEdgeData>
TEdgeData& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetDat ( ) [inline]

Definition at line 566 of file network.h.

References TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurEdge, TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurNode, and TNodeEDatNet< TNodeData, TEdgeData >::TNodeI::GetOutEDat().

{ return CurNode.GetOutEDat(CurEdge); }

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>
const TEdgeData& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetDat ( ) const [inline]

Definition at line 567 of file network.h.

References TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurEdge, TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurNode, and TNodeEDatNet< TNodeData, TEdgeData >::TNodeI::GetOutEDat().

{ return CurNode.GetOutEDat(CurEdge); }

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>
TNodeData& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetDstNDat ( ) [inline]

Definition at line 570 of file network.h.

References TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurEdge, TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurNode, and TNodeEDatNet< TNodeData, TEdgeData >::TNodeI::GetOutNDat().

{ return CurNode.GetOutNDat(CurEdge); }

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>
const TNodeData& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetDstNDat ( ) const [inline]

Definition at line 571 of file network.h.

References TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurEdge, TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurNode, and TNodeEDatNet< TNodeData, TEdgeData >::TNodeI::GetOutNDat().

{ return CurNode.GetOutNDat(CurEdge); }

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>
int TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetDstNId ( ) const [inline]

Gets the destination node of an edge.

Definition at line 563 of file network.h.

References TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurEdge, TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurNode, and TNodeEDatNet< TNodeData, TEdgeData >::TNodeI::GetOutNId().

{ return CurNode.GetOutNId(CurEdge); }

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>
int TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetId ( ) const [inline]

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

Definition at line 559 of file network.h.

{ return -1; }
template<class TNodeData, class TEdgeData>
TNodeData& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetSrcNDat ( ) [inline]

Definition at line 568 of file network.h.

References TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurNode.

{ return CurNode(); }
template<class TNodeData, class TEdgeData>
const TNodeData& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetSrcNDat ( ) const [inline]

Definition at line 569 of file network.h.

References TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurNode.

{ return CurNode(); }
template<class TNodeData, class TEdgeData>
int TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetSrcNId ( ) const [inline]

Gets the source node of an edge.

Definition at line 561 of file network.h.

References TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurNode, and TNodeEDatNet< TNodeData, TEdgeData >::TNodeI::GetId().

{ return CurNode.GetId(); }

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>
TEdgeData& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator() ( ) [inline]

Definition at line 564 of file network.h.

References TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurEdge, TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurNode, and TNodeEDatNet< TNodeData, TEdgeData >::TNodeI::GetOutEDat().

{ return CurNode.GetOutEDat(CurEdge); }

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>
const TEdgeData& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator() ( ) const [inline]

Definition at line 565 of file network.h.

References TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurEdge, TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurNode, and TNodeEDatNet< TNodeData, TEdgeData >::TNodeI::GetOutEDat().

{ return CurNode.GetOutEDat(CurEdge); }

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>
TEdgeI& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator++ ( int  ) [inline]

Increment iterator.

Definition at line 554 of file network.h.

References TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurEdge, TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurNode, TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::EndNode, and TNodeEDatNet< TNodeData, TEdgeData >::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, class TEdgeData>
bool TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator< ( const TEdgeI &  EdgeI) const [inline]

Definition at line 556 of file network.h.

References TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurEdge, and TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurNode.

{ return CurNode<EdgeI.CurNode || (CurNode==EdgeI.CurNode && CurEdge<EdgeI.CurEdge); }
template<class TNodeData, class TEdgeData>
TEdgeI& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator= ( const TEdgeI &  EdgeI) [inline]

Definition at line 552 of file network.h.

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

{ if (this!=&EdgeI) { CurNode=EdgeI.CurNode;  EndNode=EdgeI.EndNode;  CurEdge=EdgeI.CurEdge; }  return *this; }
template<class TNodeData, class TEdgeData>
bool TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator== ( const TEdgeI &  EdgeI) const [inline]

Definition at line 557 of file network.h.

References TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurEdge, and TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurNode.

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

Friends And Related Function Documentation

template<class TNodeData, class TEdgeData>
friend class TNodeEDatNet< TNodeData, TEdgeData > [friend]

Definition at line 572 of file network.h.

Member Data Documentation

template<class TNodeData, class TEdgeData>
int TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurEdge [private]

Definition at line 547 of file network.h.

Referenced by TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetDat(), TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetDstNDat(), TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetDstNId(), TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator()(), TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator++(), TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator<(), TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator=(), and TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator==().

template<class TNodeData, class TEdgeData>
TNodeI TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurNode [private]

Definition at line 546 of file network.h.

Referenced by TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetDat(), TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetDstNDat(), TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetDstNId(), TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetSrcNDat(), TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetSrcNId(), TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator()(), TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator++(), TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator<(), TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator=(), and TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator==().

template<class TNodeData, class TEdgeData>
TNodeI TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::EndNode [private]

Definition at line 546 of file network.h.

Referenced by TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator++(), and TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator=().

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