Graph, Graph Algorithm.
vertex and iterate through vertices of the graph, it is natural to parallelize the outer for loop that iterates through vertices at Line 39. The task in the BSP execution processes the body of the outer for loop for a subset of vertices. This iteration is called a superstep in the BSP parlance.