|
SNAP Library, User Reference
2012-10-02 12:56:23
SNAP, a general purpose network analysis and graph mining library
|
Node iterator. Only forward iteration (operator++) is supported. More...
Public Member Functions | |
| TNodeI () | |
| TNodeI (const THashIter &LeftHIter, const THashIter &RightHIter) | |
| TNodeI (const TNodeI &NodeI) | |
| TNodeI & | operator= (const TNodeI &NodeI) |
| TNodeI & | operator++ (int) |
| Increment iterator. | |
| bool | operator< (const TNodeI &NodeI) const |
| bool | operator== (const TNodeI &NodeI) const |
| int | GetId () const |
| Returns ID of the current node. | |
| bool | IsLeft () const |
| Tests whether the node is left hand side node. | |
| bool | IsRight () const |
| Tests whether the node is right hand side node. | |
| int | GetDeg () const |
| Returns degree of the current node. | |
| int | GetInDeg () const |
| Returns in-degree of the current node (returns same as value GetDeg() since the graph is undirected). | |
| int | GetOutDeg () const |
| Returns out-degree of the current node (returns same as value GetDeg() since the graph is undirected). | |
| int | GetInNId (const int &NodeN) const |
| Returns ID of NodeN-th in-node (the node pointing to the current node). | |
| int | GetOutNId (const int &NodeN) const |
| Returns ID of NodeN-th out-node (the node the current node points to). | |
| int | GetNbrNId (const int &NodeN) const |
| Returns ID of NodeN-th neighboring node. | |
| bool | IsInNId (const int &NId) const |
| Tests whether node with ID NId points to the current node. | |
| bool | IsOutNId (const int &NId) const |
| Tests whether the current node points to node with ID NId. | |
| bool | IsNbrNId (const int &NId) const |
| Tests whether node with ID NId is a neighbor of the current node. | |
Friends | |
| class | TBPGraph |
Node iterator. Only forward iteration (operator++) is supported.
| TBPGraph::TNodeI::TNodeI | ( | ) | [inline] |
| TBPGraph::TNodeI::TNodeI | ( | const THashIter & | LeftHIter, |
| const THashIter & | RightHIter | ||
| ) | [inline] |
| TBPGraph::TNodeI::TNodeI | ( | const TNodeI & | NodeI | ) | [inline] |
| int TBPGraph::TNodeI::GetDeg | ( | ) | const [inline] |
Returns degree of the current node.
| int TBPGraph::TNodeI::GetId | ( | ) | const [inline] |
Returns ID of the current node.
| int TBPGraph::TNodeI::GetInDeg | ( | ) | const [inline] |
Returns in-degree of the current node (returns same as value GetDeg() since the graph is undirected).
| int TBPGraph::TNodeI::GetInNId | ( | const int & | NodeN | ) | const [inline] |
Returns ID of NodeN-th in-node (the node pointing to the current node).
| int TBPGraph::TNodeI::GetNbrNId | ( | const int & | NodeN | ) | const [inline] |
Returns ID of NodeN-th neighboring node.
| int TBPGraph::TNodeI::GetOutDeg | ( | ) | const [inline] |
Returns out-degree of the current node (returns same as value GetDeg() since the graph is undirected).
| int TBPGraph::TNodeI::GetOutNId | ( | const int & | NodeN | ) | const [inline] |
Returns ID of NodeN-th out-node (the node the current node points to).
| bool TBPGraph::TNodeI::IsInNId | ( | const int & | NId | ) | const [inline] |
Tests whether node with ID NId points to the current node.
| bool TBPGraph::TNodeI::IsLeft | ( | ) | const [inline] |
Tests whether the node is left hand side node.
| bool TBPGraph::TNodeI::IsNbrNId | ( | const int & | NId | ) | const [inline] |
Tests whether node with ID NId is a neighbor of the current node.
| bool TBPGraph::TNodeI::IsOutNId | ( | const int & | NId | ) | const [inline] |
Tests whether the current node points to node with ID NId.
| bool TBPGraph::TNodeI::IsRight | ( | ) | const [inline] |
Tests whether the node is right hand side node.
| TNodeI& TBPGraph::TNodeI::operator++ | ( | int | ) | [inline] |
Increment iterator.
| bool TBPGraph::TNodeI::operator< | ( | const TNodeI & | NodeI | ) | const [inline] |
| bool TBPGraph::TNodeI::operator== | ( | const TNodeI & | NodeI | ) | const [inline] |
friend class TBPGraph [friend] |