Hello all,

I want to implement a graph partitioning algorithm using Apache Giraph.
In Giraph, a vertex executes its compute() function only if it retrieves a message from an adjacent vertex which was executed at the previous superstep. In my case, I want to decide which vertices will be executed in each superstep, and store the current messages for later use.
Is this possible?

Thanks in advance,
Nikolaos

Reply via email to