FlashGraphng
A new frontier in largescale graph analysis and data mining

A directed version of the compute_vertex
class that users inherit from when using the FlashGraph engine.
More...
#include <graph_engine.h>
Public Member Functions  
compute_directed_vertex (vertex_id_t id)  
The constructor callled by the grah engne.  
void  request_partial_vertices (directed_vertex_request reqs[], size_t num) 
This allows a vertex to request partial vertices in the graph. Defn: ""partial vertices"" – Part of a vertex's data. Specifically either a vertex's inedges OR outedges. This eliminates the overhead of bringing both in and out edges into the page cache when an algorithm only requires one of the two. More...  
Public Member Functions inherited from fg::compute_vertex  
compute_vertex (vertex_id_t id)  
The constructor called by graph_engine to create vertex state. More...  
void  request_vertices (vertex_id_t ids[], size_t num) 
This allows a vertex to request the adjacency lists of vertices in the graph. More...  
void  request_vertex_headers (vertex_id_t ids[], size_t num) 
This requests the vertex headers. It mainly contains the number of edges (the number of inedges and outedges for directed vertices). More...  
void  notify_iteration_end (vertex_program &prog) 
Allows a vertex to perform a task at the end of every iteration. More...  
void  run_on_vertex_header (vertex_program &prog, const vertex_header &header) 
This method is invoked by calling the request_vertex_headers method and is where one would access the vertex in/out edges. More...  
void  run_on_message (vertex_program &vprog, const vertex_message &msg) 
This method is invoked when the vertex receives a message. More...  
A directed version of the compute_vertex
class that users inherit from when using the FlashGraph engine.
void fg::compute_directed_vertex::request_partial_vertices  (  directed_vertex_request  reqs[], 
size_t  num  
) 
This allows a vertex to request partial vertices in the graph.
Defn: ""partial vertices"" – Part of a vertex's data. Specifically either a vertex's inedges OR outedges. This eliminates the overhead of bringing both in and out edges into the page cache when an algorithm only requires one of the two.
reqs  This is an array corresponding to the vertices you are requesting and defines which part of the vertex you want (e.g IN_EDGE ). 
num  the number of elements in reqs . 