Specifically, at each iteration the algorithm analyzes each node s in random order and assigns it to the majority class among those associated with its neighbors.
it assigns each node s to the class c that maximizes the sum of the weights of the edges s i , s j incident on s j such that c is the class of s i (Equation 6).