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
|
NodeEdge Attr iterator. Iterate through all node for one attr value. More...
#include <network.h>
Public Member Functions | |
TAFltI () | |
TAFltI (const TFltVecIter &HIter, TStr attribute, bool isEdgeIter, const TNEANet *GraphPt) | |
TAFltI (const TAFltI &I) | |
TAFltI & | operator= (const TAFltI &I) |
bool | operator< (const TAFltI &I) const |
bool | operator== (const TAFltI &I) const |
TFlt | GetDat () const |
Returns an attribute of the node. | |
bool | IsDeleted () const |
Returns true if node or edge has been deleted. | |
TAFltI & | operator++ (int) |
Private Types | |
typedef TFltV::TIter | TFltVecIter |
Private Attributes | |
TFltVecIter | HI |
bool | isNode |
TStr | attr |
const TNEANet * | Graph |
Friends | |
class | TNEANet |
NodeEdge Attr iterator. Iterate through all node for one attr value.
typedef TFltV::TIter TNEANet::TAFltI::TFltVecIter [private] |
TNEANet::TAFltI::TAFltI | ( | ) | [inline] |
TNEANet::TAFltI::TAFltI | ( | const TFltVecIter & | HIter, |
TStr | attribute, | ||
bool | isEdgeIter, | ||
const TNEANet * | GraphPt | ||
) | [inline] |
TNEANet::TAFltI::TAFltI | ( | const TAFltI & | I | ) | [inline] |
TFlt TNEANet::TAFltI::GetDat | ( | ) | const [inline] |
bool TNEANet::TAFltI::IsDeleted | ( | ) | const [inline] |
TAFltI& TNEANet::TAFltI::operator++ | ( | int | ) | [inline] |
bool TNEANet::TAFltI::operator< | ( | const TAFltI & | I | ) | const [inline] |
bool TNEANet::TAFltI::operator== | ( | const TAFltI & | I | ) | const [inline] |
TStr TNEANet::TAFltI::attr [private] |
const TNEANet* TNEANet::TAFltI::Graph [private] |
TFltVecIter TNEANet::TAFltI::HI [private] |
bool TNEANet::TAFltI::isNode [private] |