Java, Giraph, Hadoop, Graph Processing.
vertices except the source vertex (vertex 1) defines minDist as Double.MAX_VALUE. For vertex 1 this is zero. Then vertices iterate through the received messages to see if there’s a better minimum cost. If such value exist then vertices send that plus edge cost to their neighbors. The last line