Public Member Functions | |
void | update (graphchi_vertex< VertexDataType, EdgeDataType > &v, graphchi_context &gcontext) |
void | before_iteration (int iteration, graphchi_context &gcontext) |
void | after_iteration (int iteration, graphchi_context &gcontext) |
void | before_exec_interval (vid_t window_st, vid_t window_en, graphchi_context &gcontext) |
void | after_exec_interval (vid_t window_st, vid_t window_en, graphchi_context &gcontext) |
Additional Inherited Members | |
![]() | |
typedef VertexDataType | VertexDataType |
typedef EdgeDataType | EdgeDataType |
GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> class. The main logic is usually in the update function.
|
inlinevirtual |
Called after an execution interval has finished.
Reimplemented from graphchi::GraphChiProgram< VertexDataType, EdgeDataType >.
|
inlinevirtual |
Called after an iteration has finished.
Reimplemented from graphchi::GraphChiProgram< VertexDataType, EdgeDataType >.
|
inlinevirtual |
Called before an execution interval is started.
On every even iteration, we store pivot's adjacency lists to memory. Here we manage the memory to ensure that we do not load too much edges into memory.
Reimplemented from graphchi::GraphChiProgram< VertexDataType, EdgeDataType >.
|
inlinevirtual |
Called before an iteration starts.
Reimplemented from graphchi::GraphChiProgram< VertexDataType, EdgeDataType >.
|
inlinevirtual |
Vertex update function.
Iterate through the edges, and if an edge is from a pivot vertex, compute intersection of the relevant adjacency lists.
Implements graphchi::GraphChiProgram< VertexDataType, EdgeDataType >.