#include <TwitterEdge.h>
Public Member Functions | |
TwitterEdge () | |
template<typename X > | |
TwitterEdge (X x) | |
TwitterEdge (short mycount, bool myfollow, time_t mylatest) | |
bool | isFollower () const |
bool | isRetwitter () const |
bool | TweetWithinInterval (time_t begin, time_t end) const |
bool | TweetSince (time_t begin) const |
bool | LastTweetBy (time_t end) const |
operator bool () const | |
TwitterEdge & | operator+= (const TwitterEdge &rhs) |
bool | operator== (const TwitterEdge &b) const |
Friends | |
template<typename IT > | |
class | TwitterReadSaveHandler |
struct | DetSymmetricize |
std::ostream & | operator<< (std::ostream &os, const TwitterEdge &twe) |
TwitterEdge | operator* (const TwitterEdge &a, const TwitterEdge &b) |
This is not part of the Combinatorial BLAS library, it's just an example. A nonzero A(i,j) is present if at least one edge (of any type) from vertex i to vertex j exists. Multiple types of edges are supported: follower/retweeter (or both)
Definition at line 15 of file TwitterEdge.h.
|
inline |
Definition at line 18 of file TwitterEdge.h.
|
inline |
Definition at line 20 of file TwitterEdge.h.
|
inline |
Definition at line 22 of file TwitterEdge.h.
|
inline |
Definition at line 23 of file TwitterEdge.h.
|
inline |
Definition at line 24 of file TwitterEdge.h.
|
inline |
Definition at line 27 of file TwitterEdge.h.
|
inline |
Definition at line 29 of file TwitterEdge.h.
|
inline |
Definition at line 31 of file TwitterEdge.h.
|
inline |
Definition at line 40 of file TwitterEdge.h.
|
inline |
Definition at line 26 of file TwitterEdge.h.
|
inline |
Definition at line 25 of file TwitterEdge.h.
|
friend |
Definition at line 56 of file TwitterEdge.h.
|
friend |
Definition at line 68 of file TwitterEdge.h.
|
friend |
Definition at line 59 of file TwitterEdge.h.
|
friend |
Definition at line 54 of file TwitterEdge.h.