/**

void update(graphchi_vertex<VertexDataType, EdgeDataType> &vertex, graphchi_context &gcontext) {

if (ginfo.iteration == 0) {

/* On first iteration, initialize vertex (and its edges). This is usually required, because

// vertex.set_data(init_value);

} else {

/* Do computation */

/* Loop over in-edges (example) */

for(int i=0; i < vertex.num_inedges(); i++) {

// Do something

// value += vertex.inedge(i).get_data();

}

/* Loop over out-edges (example) */

for(int i=0; i < vertex.num_outedges(); i++) {

// Do something

// vertex.outedge(i).set_data(x)

}

/* Loop over all edges (ignore direction) */

for(int i=0; i < vertex.num_edges(); i++) {

// vertex.edge(i).get_data()

}

// v.set_data(new_value);

}

}

/**

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) {

}

/* GraphChi initialization will read the command line

graphchi_init(argc, argv);

/* Metrics object for keeping track of performance counters

metrics m("my-application-name");

/* Basic arguments for application */

std::string filename = get_option_string("file"); // Base filename

int niters = get_option_int("niters", 4); // Number of iterations

bool scheduler = get_option_int("scheduler", 0); // Whether to use selective scheduling

/* Detect the number of shards or preprocess an input to create them */

int nshards = convert_if_notexists<EdgeDataType>(filename,

get_option_string("nshards", "auto"));

/* Run */

MyGraphChiProgram program;

graphchi_engine<VertexDataType, EdgeDataType> engine(filename, nshards, scheduler, m);

engine.run(program, niters);

/* Report execution metrics */

metrics_report(m);

return 0;