|
SNAP Library 2.1, User Reference
2013-09-25 10:47:25
SNAP, a general purpose, high performance system for analysis and manipulation of large networks
|
Edge iterator. Only forward iteration (operator++) is supported. More...
#include <network.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. | |
| 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 > |
Edge iterator. Only forward iteration (operator++) is supported.
| TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::TEdgeI | ( | ) | [inline] |
| TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::TEdgeI | ( | const TNodeI & | NodeI, |
| const TNodeI & | EndNodeI, | ||
| const int & | EdgeN = 0 |
||
| ) | [inline] |
| TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::TEdgeI | ( | const TEdgeI & | EdgeI | ) | [inline] |
| TEdgeData& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetDat | ( | ) | [inline] |
Definition at line 566 of file network.h.
{ return CurNode.GetOutEDat(CurEdge); }
| const TEdgeData& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetDat | ( | ) | const [inline] |
Definition at line 567 of file network.h.
{ return CurNode.GetOutEDat(CurEdge); }
| TNodeData& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetDstNDat | ( | ) | [inline] |
Definition at line 570 of file network.h.
{ return CurNode.GetOutNDat(CurEdge); }
| const TNodeData& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetDstNDat | ( | ) | const [inline] |
Definition at line 571 of file network.h.
{ return CurNode.GetOutNDat(CurEdge); }
| int TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetDstNId | ( | ) | const [inline] |
| int TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetId | ( | ) | const [inline] |
| TNodeData& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetSrcNDat | ( | ) | [inline] |
| const TNodeData& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetSrcNDat | ( | ) | const [inline] |
| int TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::GetSrcNId | ( | ) | const [inline] |
| TEdgeData& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator() | ( | ) | [inline] |
Definition at line 564 of file network.h.
{ return CurNode.GetOutEDat(CurEdge); }
| const TEdgeData& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator() | ( | ) | const [inline] |
Definition at line 565 of file network.h.
{ return CurNode.GetOutEDat(CurEdge); }
| TEdgeI& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator++ | ( | int | ) | [inline] |
| bool TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator< | ( | const TEdgeI & | EdgeI | ) | const [inline] |
| TEdgeI& TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator= | ( | const TEdgeI & | EdgeI | ) | [inline] |
| bool TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::operator== | ( | const TEdgeI & | EdgeI | ) | const [inline] |
friend class TNodeEDatNet< TNodeData, TEdgeData > [friend] |
int TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurEdge [private] |
TNodeI TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::CurNode [private] |
TNodeI TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI::EndNode [private] |