Currently the data structure used by algorithms (vertex programs) is bond to its specific data type. Thus we need a transformation of the a graph to run an algorithm.
I suggest that we make some programs into templates, so that algorithms can run on any graph having the given fields.
For example, we can make the 'pagerank' program using a templated vertex data type T. Then we store the computed (and intermediate) result into the 'pagerank' field.
This way is more efficient than using reflection mechanisms.
Currently the data structure used by algorithms (vertex programs) is bond to its specific data type. Thus we need a transformation of the a graph to run an algorithm.
I suggest that we make some programs into templates, so that algorithms can run on any graph having the given fields.
For example, we can make the 'pagerank' program using a templated vertex data type T. Then we store the computed (and intermediate) result into the 'pagerank' field.
This way is more efficient than using reflection mechanisms.