SNAP Library 6.0, User Reference
2020-12-09 16:24:20
SNAP, a general purpose, high performance system for analysis and manipulation of large networks
|
Edge iterator. Only forward iteration (operator++) is supported. More...
#include <graph.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. 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 ('left' side) of an edge. Since the graph is undirected this is the node with smaller ID of the edge endpoints. More... | |
int | GetDstNId () const |
Gets destination ('right' side) of an edge. Since the graph is undirected this is the node with greater ID of the edge endpoints. More... | |
int | GetLNId () const |
Gets the ID of the node on the 'left' side of the edge. More... | |
int | GetRNId () const |
Gets the ID of the node on the 'right' side of the edge. More... | |
Private Attributes | |
TNodeI | CurNode |
TNodeI | EndNode |
int | CurEdge |
Friends | |
class | TBPGraph |
Edge iterator. Only forward iteration (operator++) is supported.
|
inline |
|
inline |
Gets destination ('right' side) of an edge. Since the graph is undirected this is the node with greater ID of the edge endpoints.
Definition at line 1037 of file graph.h.
|
inline |
|
inline |
Gets the ID of the node on the 'left' side of the edge.
Definition at line 1039 of file graph.h.
|
inline |
Gets the ID of the node on the 'right' side of the edge.
Definition at line 1041 of file graph.h.
|
inline |
|
inline |
Increment iterator.
Definition at line 1028 of file graph.h.
|
inline |
|
inline |