libgrape-lite
A C++ library for parallel graph processing
|
A iteratable adjencent list of a vertex. The list contains all neighbors in format of Nbr, which contains the other Node and the data on the Edge. More...
#include <adj_list.h>
Classes | |
class | const_iterator |
class | iterator |
Public Member Functions | |
DEV_HOST | AdjList (NbrT *b, NbrT *e) |
DEV_HOST_INLINE bool | Empty () const |
DEV_HOST_INLINE bool | NotEmpty () const |
DEV_HOST_INLINE size_t | Size () const |
DEV_HOST iterator | begin () |
DEV_HOST iterator | end () |
DEV_HOST const_iterator | begin () const |
DEV_HOST const_iterator | end () const |
DEV_HOST NbrT * | begin_pointer () |
DEV_HOST const NbrT * | begin_pointer () const |
DEV_HOST NbrT * | end_pointer () |
DEV_HOST const NbrT * | end_pointer () const |
DEV_HOST bool | empty () const |
Private Types | |
using | NbrT = Nbr< VID_T, EDATA_T > |
Private Attributes | |
NbrT * | begin_ |
NbrT * | end_ |