There's no built-in support for doing this, so the best option is to copy and
modify Pregel to check the accumulator at the end of each iteration. This is
robust and shouldn't be too hard, since the Pregel code is short and only uses
public GraphX APIs.
Ankur
At 2014-12-03 09:37:01 -0800, Jay
I'm trying to implement a graph algorithm that does a form of path
searching. Once a certain criteria is met on any path in the graph, I
wanted to halt the rest of the iterations. But I can't see how to do that
with the Pregel API, since any vertex isn't able to know the state of other
arbitrary
I'm trying to implement a graph algorithm that does a form of path
searching. Once a certain criteria is met on any path in the graph, I
wanted to halt the rest of the iterations. But I can't see how to do that
with the Pregel API, since any vertex isn't able to know the state of other
arbitrary
